Publication:3798235
From MaRDI portal
zbMath0652.68048MaRDI QIDQ3798235
Michael R. Fellows, Michael A. Langston
Publication date: 1988
VLSI; graph minors; scaffolding; self-reduction; Robertson-Seymour theorems; construction versions; well-partial-ordering of graphs
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68R99: Discrete mathematics in relation to computer science
Related Items
A polynomial algorithm for recognizing bounded cutwidth in hypergraphs, Constructive complexity, Improved self-reduction algorithms for graphs with bounded treewidth, Fixed-Parameter Tractability of Treewidth and Pathwidth, Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs, Polynomial-time self-reducibility: theoretical motivations and practical results∗