Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs

  • Thomas Lengauer
Contributed Papers
Part of the Lecture Notes in Computer Science book series (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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [GGST 85]
    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 COMBINATORIKAGoogle Scholar
  2. [GJ 79]
    M.R. Garey/D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (CA), 1979Google Scholar
  3. [HILL]
    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–149Google Scholar
  4. [HT 84]
    D. Harel/R.E. Tarjan: Fast algorithms for finding nearest common ancestors. In: SICOMP 13.2 (1984), 338–355Google Scholar
  5. [L 82]
    T. Lengauer: The complexity of compacting hierarchically specified layouts of integrated circuits. 23rd IEEE-FOCS 1982, 358–368Google Scholar
  6. [L 85a]
    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, 1985Google Scholar
  7. [L 85b]
    T. Lengauer: Hierarchical planarity testing algorithms. Reihe "Theoretische Informatik" No. 25, FB 17, Universität-Gesamthochschule Paderborn, Paderborn, West-Germany, 1985Google Scholar
  8. [L 85c]
    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, 1985Google Scholar
  9. [T 83]
    R.E. Tarjan: Data structures and network algorithms. SIAM, Philadelphia (PA), 1983Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Thomas Lengauer
    • 1
  1. 1.Universität-Gesamthochschule PaderbornPaderbornWest Germany

Personalised recommendations