Skip to main content
SpringerLink
Log in

Canonical representations of partial 2-and 3-trees

  • Conference paper
  • First Online:
SWAT 90 (SWAT 1990)

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

Included in the following conference series:

  • 977 Accesses

Abstract

We give linear time algorithms constructing canonical representations of partial 2-trees (series parallel graphs) and partial 3-trees. These algorithms directly give a linear time isomorphism algorithm for partial 3-trees.

Supported in part by a grant from NFR.

Research supported in part by the Office of Naval Research Contract N00014-86-K-0419.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aho, Hopcroft and Ullman, Design and Analysis of Computer Algorithms Addison-Wesley 1972.

    Google Scholar 

  2. S. Arnborg, Efficient Algorithms for Combinatorial Problems on Graphs with Bounded Decomposability — A Survey, BIT 25 (1985), 2–33.

    Google Scholar 

  3. S. Arnborg, D.G. Corneil and A. Proskurowski, Complexity of Finding Embeddings in a k-tree, SIAM J. Alg. and Discr. Methods 8(1987), 277–287.

    Google Scholar 

  4. S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese, An algebraic theory of graph reduction, Bordeaux-I University Report I-9002(1990), submitted.

    Google Scholar 

  5. S. Arnborg and A. Proskurowski, Characterization and Recognition of Partial 3-trees, SIAM J. Alg. and Discr. Methods 7(1986), 305–314.

    Google Scholar 

  6. S. Arnborg and A. Proskurowski, Linear Time Algorithms for NP-hard Problems on Graphs Embedded in k-trees, Discr. Appl. Math. 23(1989) 11–24.

    Article  Google Scholar 

  7. H.L. Bodlaender, Polynomial Algorithms for graph isomorphism and chromatic index on partial k-trees. SWAT, Springer-Verlag LNCS 318 (1988), 227–232.

    Google Scholar 

  8. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, North Holland (1976).

    Google Scholar 

  9. K.S. Booth, Finding a lexicographic least shift of a string, Information Processing Letters 10 (1980), 240–242

    Google Scholar 

  10. C.J. Colbourn and K.S. Booth, Linear time automorphism algorithms for trees, interval graphs, and planar graphs, SIAM J. Computing 10 (1981), 203–225

    Google Scholar 

  11. I.S. Filotti and J.N. Mayer, A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Bounded Genus, Proc. 12th ACM Symp. on Theory of Computing (1980), 236–243.

    Google Scholar 

  12. M. Fontet, A Linear Algorithm for Testing Isomorphism of Planar Graphs, Proc. 3rd Int. Conf. Automata, Languages, Programming, Springer-Verlag LNCS (1976), 1411–423.

    Google Scholar 

  13. M.R. Garey and D.S. Johnson, Computers and Intractability, W.H. Freeman and Company, San Francisco (1979).

    Google Scholar 

  14. J.E. Hopcroft and J.K. Wong, A Linear Time Algorithm for Isomorphism of Planar Graphs, Proc. 6th ACM Symp. Theory of Computer Science (1974), 172–184.

    Google Scholar 

  15. E.M. Luks, Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time, JCSS 25(1982), 42–65

    Google Scholar 

  16. G.L. Miller, Isomorphism Testing for Graphs with Bounded Genus, Proc. 12th ACM Symp. on Theory of Computing (1980), 225–235.

    Google Scholar 

  17. G.L. Miller, Isomorphism Tesing and Cannonical Forms for k-contractible Graphs, Proc. Foundations of Computation Theory, Springer-Verlag LNCS 158 (1983), 310–327.

    Google Scholar 

  18. A. Proskurowski, Recursive graphs, recursive labelings and shortest paths, SIAM J. Computing 10 (1981), 391–397

    Google Scholar 

  19. A. Proskurowski, Separating Subgraphs in k-trees: Cables and Caterpillars, Discr. Math. 49(1984), 275–285.

    Google Scholar 

  20. D.J. Rose, Triangulated Graphs and the Elimination Process, J. Math. Anal. Appl. 32 (1970) 597–609.

    Article  Google Scholar 

  21. J.J. Rotman, The theory of Groups (2nd ed.), Allyn and Bacon, 1973.

    Google Scholar 

  22. P. Scheffler, Linear time algorithms for NP-complete problems for partial k-trees, R-MATH-03/87 (1987)

    Google Scholar 

  23. Y. Shiloah, A fast equivalence-checking algorithm for circular lists, Information Processing Letters 8 (1979), 236–238

    Google Scholar 

  24. M.M. Sysło, Linear Time Algorithm for Coding Outerplanar Graphs, in Beitrage zur Graphenteorie und deren Anvendungen, Vorgetragen auf dem internationellen Kolloquium in Oberhof (DDR), H. Sachs (ed.) (1978), 259–269; TRN-20 1977, Institute of Computer Science, Wrocław University.

    Google Scholar 

  25. A. Wald and C.J. Colbourn, Steiner Trees, Partial 2-trees, and Minimum IFI Networks, Networks 13 (1983), 159–167.

    Google Scholar 

  26. T.V. Wimer, Linear algorithms on k-terminal graphs, PhD. Thesis, Clemson University (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NADA, KTH, S-100 44, Stockholm, Sweden

    Stefan Arnborg

  2. Department of Computer and Information Science, University of Oregon, 97403, Eugene, Oregon, USA

    Andrzej Proskurowski

Authors
  1. Stefan Arnborg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Proskurowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John R. Gilbert Rolf Karlsson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arnborg, S., Proskurowski, A. (1990). Canonical representations of partial 2-and 3-trees. In: Gilbert, J.R., Karlsson, R. (eds) SWAT 90. SWAT 1990. Lecture Notes in Computer Science, vol 447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52846-6_100

Download citation

  • DOI: https://doi.org/10.1007/3-540-52846-6_100

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52846-3

  • Online ISBN: 978-3-540-47164-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation