Two flow network simplification algorithms

Authors:
Ewa Misiołek;Danny Z. Chen
Affiliations:
Mathematics Department, Saint Mary's College, Notre Dame, IN and Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN
Venue:
Information Processing Letters
Year:
2006

Citing 8
Cited 0

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
A data structure for dynamic trees

Journal of Computer and System Sciences
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Dominators in Linear Time

SIAM Journal on Computing
Introduction to Algorithms: A Creative Approach

Introduction to Algorithms: A Creative Approach
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Introduction to Algorithms

Introduction to Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

Flow network simplification can reduce the size of the flow network and hence the amount of computation performed by flow algorithms. We present the first linear time algorithm for the undirected network case. We also give an O(|E| × (|V| + |E|)) time algorithm for the directed case, an improvement over the previous best O(|V| + |E|2 log |V|) time solution. Both of our algorithms are quite simple.