Hierarchical planarity testing algorithms

  • Thomas Lengauer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)


Using hierarchical definitions one can describe very large graphs in small space. The blow-up from the length of the hierarchical description to the size of the graph can be as large as exponential. If the efficiency of graph algorithms is measured in terms of the length of the hierarchical description rather than in terms of the graph size, algorithms that do not exploit the hierarchy become hopelessly inefficient. Whether the hierarchy can be exploited to speed up the solution of graph problems depends on the hierarchical graph model. In the literature, hierarchical graph models have been described that allow almost no exploitation of the hierarchy [W 84]. We present a hierarchical graph model that permits to exploit the hierarchy. For this model we give algorithms that test planarity of a hierarchically described graph in linear time in the length of the hierarchical description.


Graph Problem Articulation Point Construction Problem Common Face Full Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. References

  1. [BL 76]
    Booth, K.S./Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. JCSS, Vol. 13 (1976), 335–379Google Scholar
  2. [BOW 83]
    Bentley, J.L./Ottmann, T./Widmayer, P.: The complexity of manipulating hierarchically defined sets of rectangles. In: Advances in Computing Research (F.P. Preparata, ed.) (JAI Press Inc.) 1 (1983), 127–158Google Scholar
  3. [CN 85]
    Chiba, N./Nishuzeki, T.: A linear algorithm for embedding planar graphs using PQ-trees. JCSS 30,1 (1985), 54–76Google Scholar
  4. [HILL]
    Lengauer, T./Mehlhorn, K.: The HILL-System: A design environment for the hierarchical specification, compaction and simulation of integrated circuit layouts. Proceedings of the MIT-Conference on Advanced Research in VLSI (P. Penfield Jr. ed.), Artech House Company (1984), 139–149Google Scholar
  5. [HS 84]
    Huang, M.A./Steiglitz, K.: A hierarchical compaction algorithm with low page-fault complexity. Proc. Conference on Advanced Research in VLSI (P. Penfield Jr. ed.), Artech House Inc. (1984), 203–212Google Scholar
  6. [HT 73]
    Hopcroft, J./Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2,3 (1973), 145–169Google Scholar
  7. [HT 74]
    Hopcroft, J./Tarjan, R.E.: Efficient planarity testing. JACM 21,4 (1974), 549–568Google Scholar
  8. [L 82]
    Lengauer, T.: The complexity of compacting hierarchically specified layouts of integrated circuits. 23rd IEEE-FOCS (1982), 358–368Google Scholar
  9. [L 85a]
    Lengauer, T.: Efficient solution of connectivity problems on hierarchically defined graphs. "Theoretische Informatik" No. 24, FB 17, Universität-Gesamthochschule Paderborn, Paderborn, West-Germany (1985) (short version in: Proc. of WG '85 (H. Noltemeier, ed.), Trauner Verlag (1985), 201–216)Google Scholar
  10. [L 85b]
    Lengauer, T.: Hierarchical planarity testing algorithms. "Theoretische Informatik" No. 25, FB 17, Universität-Gesamthochschule Paderborn, Paderborn, West-Germany (1985)Google Scholar
  11. [L 86]
    Lengauer, T.: Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. Proc. STACS 86 (B. Monien, G. Vidal-Naquet, eds.), Springer LNCS 210 (1986), 153–170Google Scholar
  12. [T 72]
    Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1,2 (1972), 146–160Google Scholar
  13. [W 32]
    Whitney, H.: Non-separable and planar graphs. Trans. AMS 34 (1932), 339–362Google Scholar
  14. [W 33]
    Whitney, H.: 2-isomorphic graphs. Am. J. Math. 55 (1933), 245–254Google Scholar
  15. [W 84]
    Wagner, K.: The complexity of problems concerning graphs with regularities. Proc. MFCS, Springer LNCS 176 (1984), 544–552Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

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

Personalised recommendations