On computing graph minor obstruction sets
type: Item
instance of: scholarly article
title: On computing graph minor obstruction sets
zbMATH Open document ID: 0952.68116
DOI: 10.1016/S0304-3975(97)00300-9
author: Kevin Cattell
author: Michael J. Dinneen
author: Michael R. Fellows
author: Michael A. Langston
author: Rodney G. Downey
published in: Theoretical Computer Science
publication date: 2000-08-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1495218
zbMATH Keywords: obstruction width.
zbMATH Keywords: second-order congruence
MaRDI profile type: Publication
cites work: Q4273870
cites work: Q4281679
cites work: Quickly excluding a forest
cites work: Two strikes against perfect phylogeny
cites work: Q4525262
cites work: Obstructions to within a few vertices or edges of acyclic
cites work: A simple linear-time algorithm for finding path-decompositions of small width
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Equivalent definitions of recognizability for sets of graphs of bounded tree-width
cites work: Q4850549
cites work: Nonconstructive tools for proving polynomial-time decidability
cites work: Bounding the Size of Planar Intertwines
cites work: Obstruction set isolation for the gate matrix layout problem
cites work: Q4273873
cites work: Q4036591
cites work: Q5734436
cites work: Q4273872
cites work: Graph minors. I. Excluding a forest
cites work: Q3684139
cites work: Graph minors. XX: Wagner's conjecture
description: scientific article; zbMATH DE number 1495218