scientific article
From MaRDI portal
Publication:3798235
zbMath0652.68048MaRDI QIDQ3798235
Michael R. Fellows, Michael A. Langston
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
VLSIgraph minorsscaffoldingself-reductionRobertson-Seymour theoremsconstruction versionswell-partial-ordering of graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99)
Related Items
Improved self-reduction algorithms for graphs with bounded treewidth, Fixed-Parameter Tractability of Treewidth and Pathwidth, Polynomial-time self-reducibility: theoretical motivations and practical results∗, Rank-width: algorithmic and structural results, Constructive complexity, A polynomial algorithm for recognizing bounded cutwidth in hypergraphs, Turing kernelization for finding long paths and cycles in restricted graph classes, Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs
