Quickly deciding minor-closed parameters in general graphs
type: Item
instance of: scholarly article
title: Quickly deciding minor-closed parameters in general graphs
zbMATH Open document ID: 1105.05065
author: Erik D. Demaine
author: Mohammad T. Hajiaghayi
published in: European Journal of Combinatorics
publication date: 2006-12-07T00:00:00Z
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 5077708
MaRDI profile type: Publication
full work available at URL: j.ejc.2005.07.003
OpenAlex ID: W1973646572
cites work: Graph minors. XII: Distance on a surface
cites work: Graph minors. XX: Wagner's conjecture
cites work: Deciding first-order properties of locally tree-decomposable structures
cites work: Nonconstructive tools for proving polynomial-time decidability
cites work: Q3773882
cites work: Q4393480
cites work: Q4385531
cites work: Quickly excluding a planar graph
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Q5501345
cites work: Bidimensional Parameters and Local Treewidth
cites work: Bidimensionality: new connections between FPT algorithms and PTASs
DOI: 10.1016/J.EJC.2005.07.003
Recommended article: A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
Recommended article: Graph Minors and Parameterized Algorithm Design
Recommended article: The complexity of learning minor closed graph classes
Recommended article: Q5391139
Recommended article: k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
Recommended article: Q3576658
Recommended article: Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors
Recommended article: Optimizing the graph minors weak structure theorem
Recommended article: Faster parameterized algorithms for minor containment
Recommended article: Faster Parameterized Algorithms for Minor Containment
description: scientific article; zbMATH DE number 5077708