Publication:4694755
From MaRDI portal
zbMath0768.68033MaRDI QIDQ4694755
Publication date: 29 June 1993
upper bound; treewidth; planar graph; pathwidth; cutwidth; search number; node search number; gate matrix layout; vertex separation number; black- white pebbling; minor test; self- reduction; vertex search number
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Mixed searching and proper-path-width, Complexity of path-forming games, On some optimization problems on \(k\)-trees and partial \(k\)-trees, The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues