The complexity of induced minors and related problems
type: Item
instance of: scholarly article
title: The complexity of induced minors and related problems
zbMATH Open document ID: 0816.68070
DOI: 10.1007/BF01190507
author: Michael R. Fellows
author: Jan Kratochvíl
author: Matthias Middendorf
author: Frank Pfeiffer
published in: Algorithmica
publication date: 1995-07-19T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 742714
zbMATH Keywords: graph minors
zbMATH Keywords: NP-completeness
zbMATH Keywords: treewidth
MaRDI profile type: Publication
cites work: A linear time algorithm for finding tree-decompositions of small treewidth
cites work: Induced matchings
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q3034816
cites work: The directed subgraph homeomorphism problem
cites work: Q4198056
cites work: On the Computational Complexity of Combinatorial Problems
cites work: Noncrossing Subgraphs in Topological Layouts
cites work: Planar Formulae and Their Uses
cites work: A note on odd/even cycles
cites work: Q3821580
cites work: Induced circuits in planar graphs
cites work: Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
cites work: Disjoint homotopic paths and trees in a planar graph
cites work: Disjoint paths in graphs
cites work: A Polynomial Solution to the Undirected Two Paths Problem
cites work: Graphs without \(K_ 4\) and well-quasi-ordering
cites work: 2-linked graphs
cites work: Universality considerations in VLSI circuits
description: scientific article; zbMATH DE number 742714