Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Gabow, R. Tarjan (1983)
A linear-time algorithm for a special case of disjoint set unionProceedings of the fifteenth annual ACM symposium on Theory of computing
D. Cheriton, R. Tarjan (1976)
Finding Minimum Spanning TreesSIAM J. Comput., 5
(1987)
J. ACM
(1984)
Efftcient implementation of graph algorithms using contraction
R. Tarjan (1983)
Data structures and network algorithms, 44
(1973)
Comput. Sci
H. Gabow, R. Tarjan (1984)
Efficient Algorithms for a Family of Matroid Intersection ProblemsJ. Algorithms, 5
M. Blum, R. Floyd, V. Pratt, R. Rivest, R. Tarjan (1973)
Time Bounds for SelectionJ. Comput. Syst. Sci., 7
N. Katoh, T. Ibaraki, H. Mine (1981)
An Algorithm for Finding K Minimum Spanning TreesSIAM J. Comput., 10
J. Vuillemin (1978)
A data structure for manipulating priority queuesCommun. ACM, 21
Donald Johnson (1977)
Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM (JACM), 24
H. Gabow (1973)
Implementation of algorithms for maximum matching on nonbipartite graphs
M. Fredman, R. Tarjan (1984)
Fibonacci heaps and their uses in improved network optimization algorithms
H. Gabow (1985)
A scaling algorithm for weighted matching on general graphs26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
(1976)
Combinatorial Optimization: Networks and Matroids
A. Aho, J. Hopcroft, J. Ullman (1974)
The Design and Analysis of Computer Algorithms
Z. Galil, S. Micali, H. Gabow (1982)
Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
J. Edmonds (1965)
Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics
D. Knuth (1973)
The art of computer programming: sorting and searching (volume 3)
D. Knuth (1968)
The Art of Computer Programming
(1961)
Journal of the Association for Computing MachineryNature, 190
R. Karp (1971)
A simple derivation of Edmonds' algorithm for optimum branchingsNetworks, 1
P. Camerini, L. Fratta, F. Maffioli (1979)
A note on finding optimum branchingsNetworks, 9
A. Yao (1975)
An O(|E| log log |V|) Algorithm for Finding Minimum Spanning TreesInf. Process. Lett., 4
H. Gabow, Z. Galil, T. Spencer, R. Tarjan (1986)
Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 6
R. Tarjan (1977)
Finding optimum branchingsNetworks, 7
The ( component ) merging problem is a new graph problem. Versions of this problem appear as bottlenecks in various graph algorithms. A new data structure solves this problem efficiently, and two special cases of the problem have even more efficient solutions based on other data structures. The performance of the data structures is sped up by introducing a new algorithmic tool called packets . The algorithms that use these solutions to the component merging problem also exploit new properties of two existing data structures. Specifically, औ-trees can be used simultaneously as a priority queue and a concatenable queue. Similarly, F-heaps support some kinds of split operations with no loss of efficiency. An immediate application of the solution to the simplest version of the merging problem is an ध( t ( m , n )) algorithm for finding minimum spanning trees in undirected graphs without using F-heaps, where t ( m , n ) = m log 2 log 2 log d n , the graph has n vertices and m edges, and d = max( m / n , 2). Packets also improve the F-heap minimum spanning tree algorithm, giving the fastest algorithm currently known for this problem. The efficient solutions to the merging problem and the new observation about F-heaps lead to an ध( n ( t ( m , n ) + n log n )) algorithm for finding a maximum weighted matching in general graphs. This settles an open problem posed by Tarjan 15, p. 123, where the weaker bound of O ( nm log ( n 2 / m )) was conjectured.
Journal of the ACM (JACM) – Association for Computing Machinery
Published: Jul 1, 1989
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.