Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs☆
References (11)
- H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan, Efficient algorithms for finding minimum spanning trees in...
- et al.
Computers and Intractibility: A Guide to the Theory of NP-Completeness
(1979) - et al.
The HILL-System: A design environment for the hierarchical specification, compaction, and simulation of integrated circuit layouts
- et al.
Fast algorithms for findings nearest common ancestors
The complexity of compacting hierarchically specified layouts of integrated circuits
There are more references available in the full text version of this article.
Cited by (18)
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
1997, Theoretical Computer ScienceHierarchically specified unit disk graphs
1997, Theoretical Computer ScienceComplexity of path-forming games
1993, Theoretical Computer ScienceThe correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
1992, Journal of Computer and System SciencesAlgorithms for graph problems on BNLC structured graphs
1991, Information and ComputationOn matroids and hierarchial graphs
1991, Information Processing Letters
- ☆
A preliminary version of this paper is published in the “Proceedings of STACS 86” (B. Monien and G. Vidal-Naquet, Eds.), Lecture Notes in Computer Science Vol. 210, pp. 153–170, Springer-Verlag, Berlin/New York/Heidelberg, 1986.
Copyright © 1987 Published by Elsevier Inc.