Title :
Efficient Implementation Of Graph Algorithms Using Contraction
Author :
Gabow, Harold N. ; Galil, Zvi ; Spencer, Thomas H.
Author_Institution :
University of Colorado at Boulder
Abstract :
We define a graph problem which we refer to as the component merging problem. Versions of the problem appear as bottlenecks in various graph algorithms. We show how to solve an important special case of the problem.
Keywords :
Algorithm design and analysis; Data structures; Merging; Tree graphs;
Conference_Titel :
Foundations of Computer Science, 1984. 25th Annual Symposium on
Conference_Location :
Singer Island, FL
Print_ISBN :
0-8186-0591-X
DOI :
10.1109/SFCS.1984.715935
