This is a preview of subscription content, log in via an institution to check access.
References
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)
T.Lengauer, Hierarchical planarity testing algorithms, Proceedings of ICALP '86, Springer Lecture Notes in Computer Science No. 226 pp.215–225 (1986)
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)
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).
T.Lengauer, E.Wanke, Decision problems on cellular graph grammars, Universität-GH Paderborn, Informatik Bericht 45 (1987), to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wanke, E. (1988). PLEXUS: A system for implementing hierarchical graph algorithms. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035868
Download citation
DOI: https://doi.org/10.1007/BFb0035868
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18834-6
Online ISBN: 978-3-540-48190-4
eBook Packages: Springer Book Archive