Proceedings ArticleDOI
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
Harold N. Gabow,Robert E. Tarjan +1 more
- pp 514-527
Reads0
Chats0
TLDR
An algorithm for the assignment problem (minimum cost perfect bipartite matching) that improves the best known sequential algorithm, and is within a factor of log of the bestknown bound for the problem without costs (maximum cardinality matching).Abstract:
We present algorithms for matching and related problems that run on an EREW PRAM with p processors. Given is a bipartite graph G with n vertices, m edges, and integral edge costs at most N in magnitude. We give an algorithm for the assignment problem (minimum cost perfect bipartite matching) that runs in O(√nm log (nN)(log(2p))/p) time and O(m) space, for p ≤ m/(√nlog2n). For p = 1 this improves the best known sequential algorithm, and is within a factor of log (nN) of the best known bound for the problem without costs (maximum cardinality matching). For p > 1 the time is within a factor of log p of optimum speed-up. Extensions include an algorithm for maximum cardinality bipartite matching with slightly better processor bounds, and similar results for bipartite degree-constrained subgraph problems (with and without costs). Our ideas also extend to general graph matching problems.read more
Citations
More filters
Book ChapterDOI
Parallel algorithms for shared-memory machines
TL;DR: In this paper, the authors discuss parallel algorithms for shared-memory machines and discuss the theoretical foundations of parallel algorithms and parallel architectures, and present a theoretical analysis of the appropriate logical organization of a massively parallel computer.
Journal ArticleDOI
Faster Shortest-Path Algorithms for Planar Graphs
TL;DR: An algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths and a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face are given.
Journal ArticleDOI
Faster scaling algorithms for network problems
Harold N. Gabow,Robert E. Tarjan +1 more
TL;DR: This paper presents algorithms for the assignment problem, the transportation problem, and the minimum- cost flow problem of operations research that find a minimum-cost solution, yet run in time close to the best-known bounds for the corresponding problems without costs.
Journal ArticleDOI
Finding Minimum-Cost Circulations by Successive Approximation
TL;DR: This work develops a new approach to solving minimum-cost circulation problems that combines methods for solving the maximum flow problem with successive approximation techniques based on cost scaling and shows that a minimum- cost circulation can be computed by solving a sequence of On lognC blocking flow problems.
Proceedings ArticleDOI
Faster shortest-path algorithms for planar graphs
TL;DR: The shortest-path algorithm yields an $O(n^{4/3} \log n)$-time algorithm for finding a perfect matching in a planar bipartite graph and a similar improvement is obtained for maximum flow in a directed planar graph.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
Fibonacci heaps and their uses in improved network optimization algorithms
TL;DR: Using F-heaps, a new data structure for implementing heaps that extends the binomial queues proposed by Vuillemin and studied further by Brown, the improved bound for minimum spanning trees is the most striking.
Proceedings ArticleDOI
Matching is as easy as matrix inversion
TL;DR: A new algorithm for finding a maximum matching in a general graph that its only computationally non-trivial step is the inversion of a single integer matrix, the isolating lemma, and other applications to parallel computation and randomized reductions are shown.
Journal ArticleDOI
Network Flow and Testing Graph Connectivity
Shimon Even,R. Endre Tarjan +1 more
TL;DR: An algorithm of Dinic for finding the maximum flow in a network is described and it is shown that if the vertex capacities are all equal to one, the algorithm requires at most $O(|V|^{1/2} \cdot |E|)$ time.