Canonical representations of partial 2- and 3-trees
Authors:
- 1 June 1992
- journal article
- algorithm theory
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 32 (2) , 197-214
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Isomorphism testing and canonical forms for k-contractable graphs (A generalization of bounded valence and bounded genus)Lecture Notes in Computer Science, 1983
- Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar GraphsSIAM Journal on Computing, 1981
- Lexicographically least circular substringsInformation Processing Letters, 1980
- Graph Theory with Applications1976
- On simple characterizations of k-treesDiscrete Mathematics, 1974