On the complexity of finding iso- and other morphisms for partial \(k\)- trees
type: Item
instance of: scholarly article
title: On the complexity of finding iso- and other morphisms for partial \(k\)- trees
zbMATH Open document ID: 0764.68128
DOI: 10.1016/0012-365X(92)90687-B
author: Robin Thomas
author: Jiří Matoušek
published in: Discrete Mathematics
publication date: 1993-01-17T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 97514
zbMATH Keywords: partial \(k\)-tree
zbMATH Keywords: NP-complete
zbMATH Keywords: complexity
zbMATH Keywords: polynomial algorithms
MaRDI profile type: Publication
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Q3796771
cites work: Q4198056
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: On the Computational Complexity of Combinatorial Problems
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: Algorithms finding tree-decompositions of graphs
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Graph minors. XIII: The disjoint paths problem
full work available at URL: 0012-365x(92)90687-b
OpenAlex ID: W2076043677
description: scientific article; zbMATH DE number 97514