Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1986: STACS 86 pp 153–170Cite as

Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs

  • Contributed Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 210))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.N. Gabow/Z. Galil /T. Spencer/R.E. Tarjan: Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs. Typescript 1985, to appear in COMBINATORIKA

    Google Scholar 

  2. M.R. Garey/D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (CA), 1979

    Google Scholar 

  3. T. Lengauer/K. Mehlhorn: The HILL-System: A design environment for the hierarchical specification, compaction, and simulation of integrated circuit layouts. Proc. Conference on Advanced Research in VLSI (ed. P. Penfield Jr.) M.I.T. (1984), 139–149

    Google Scholar 

  4. D. Harel/R.E. Tarjan: Fast algorithms for finding nearest common ancestors. In: SICOMP 13.2 (1984), 338–355

    Google Scholar 

  5. T. Lengauer: The complexity of compacting hierarchically specified layouts of integrated circuits. 23rd IEEE-FOCS 1982, 358–368

    Google Scholar 

  6. T. Lengauer: Efficient solution of connectivity problems on hierarchically defined graphs. Reihe "Theoretische Informatik" No. 24, FB 17, Universität-Gesamthochschule Paderborn, Paderborn, West-Germany, 1985

    Google Scholar 

  7. T. Lengauer: Hierarchical planarity testing algorithms. Reihe "Theoretische Informatik" No. 25, FB 17, Universität-Gesamthochschule Paderborn, Paderborn, West-Germany, 1985

    Google Scholar 

  8. T. Lengauer: Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. Reihe "Theoretische Informatik" No. 26, FB 17, Universität-Gesamthochschule Paderborn, Paderborn, West-Germany, 1985

    Google Scholar 

  9. R.E. Tarjan: Data structures and network algorithms. SIAM, Philadelphia (PA), 1983

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität-Gesamthochschule Paderborn, Fachbereich 17, 4790, Paderborn, West Germany

    Thomas Lengauer

Authors
  1. Thomas Lengauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien G. Vidal-Naquet

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lengauer, T. (1985). 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. https://doi.org/10.1007/3-540-16078-7_73

Download citation

  • DOI: https://doi.org/10.1007/3-540-16078-7_73

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16078-6

  • Online ISBN: 978-3-540-39758-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation