Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
- First Online:
- Cite this paper as:
- Lengauer T. (1986) Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. In: Monien B., Vidal-Naquet G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg
In [L 85a] a hierarchical graph model is defined that allows the exploitation of the hierarchy for the more efficient solution of graph problems on very large graphs. The model is motivated by applications in the design of VLSI circuits.
We show how to efficiently find minimum spanning forests in this graph model. We solve decision problems pertaining to minimum spanning forests in almost linear time in the length of the hierarchical description, query problems in time linear in the depth of the hierarchy and we construct minimum spanning forests in space linear in the length of the hierarchical description.
Unable to display preview. Download preview PDF.