Advertisement

PLEXUS: A system for implementing hierarchical graph algorithms

  • Egon Wanke
Systems Demonstrations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)

Keywords

Parse Tree Graph Problem Graph Concept Adjacency List Span Forest 
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.

References

  1. [Len 86a]
    T.Lengauer, Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs, Proceedings of STACS '86, Springer Lecture Notes in Computer Science No. 216 pp.153–170 (1986)Google Scholar
  2. [Len 86b]
    T.Lengauer, Hierarchical planarity testing algorithms, Proceedings of ICALP '86, Springer Lecture Notes in Computer Science No. 226 pp.215–225 (1986)Google Scholar
  3. [LeW 87]
    T.Lengauer, K.W. Wagner, The correlation between the complexities of the nonhierarchical and hierarchical version of graph problems, Proceedings of STACS '87, Springer Lecture Notes in Computer Science No. 247 pp.100–113 (1987)Google Scholar
  4. [LeWa 87a]
    T.Lengauer, E.Wanke, Efficient solution of connectivity problems on hierarchically defined graphs, Universität-GH Paderborn, Informatik Bericht 39 (1987), to appear in SIAM Journal of Computing. Preliminary version: T.Lengauer, Efficient solution of connectivity problems on hierarchically defined graphs, Graphtheoretic Concepts in Computer Science, Proceedings of WG' 85, Trauner Verlag Linz pp.201–215 (1985).Google Scholar
  5. [LeWa 87b]
    T.Lengauer, E.Wanke, Decision problems on cellular graph grammars, Universität-GH Paderborn, Informatik Bericht 45 (1987), to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Egon Wanke
    • 1
  1. 1.Universität-Gesamthochschule Paderbon Fachbereich 17 - Mathematik/InformatikPaderbornWest Germany

Personalised recommendations