A parallel algorithm for finding a maximum flow in 0-1 networks

Authors:
Liwu Li;T. A. Marsland
Affiliations:
Computing Science Department, University of Alberta, Edmonton, Canada T6G 2H1;Computing Science Department, University of Alberta, Edmonton, Canada T6G 2H1
Venue:
CSC '87 Proceedings of the 15th annual conference on Computer Science
Year:
1987

Citing 4
Cited 1

Graph Algorithms

Graph Algorithms
Graph problems on a mesh-connected processor array (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Computational Aspects of VLSI

Computational Aspects of VLSI
Graphs and Hypergraphs

Graphs and Hypergraphs

K-Tree: A multiple tree video multicast protocol for Ad hoc wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a parallel algorithm for finding the maximum flow in 0-1-networks. Our design is for a mesh-connected processor array and is based on the observation that an augmenting path in a 0-1-network can be found in time proportional to the number of vertices in the given network, rather than to the number of edges. Let integer n be the number of vertices in a 0-1-network. The time complexity of the parallel algorithm is &Ogr; (n2+&egr;), where &egr; can be any small positive real number.