On the complexity of finding iso- and other morphisms for partial k-trees
Authors:
- Jiři MatoušekJMJiři Matoušek
- Robin ThomasRTRobin Thomas
- 1 October 1992
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 108 (1-3) , 343-364
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Algorithms finding tree-decompositions of graphsJournal of Algorithms, 1991
- 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
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973