scientific article; zbMATH DE number 219268
From MaRDI portal
Publication:4694755
zbMath0768.68033MaRDI QIDQ4694755
Publication date: 29 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
upper boundtreewidthplanar graphpathwidthcutwidthsearch numbernode search numbergate matrix layoutvertex separation numberblack- white pebblingminor testself- reductionvertex search number
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
The pathwidth and treewidth of cographs ⋮ The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues ⋮ Mixed searching and proper-path-width ⋮ Complexity of path-forming games ⋮ Two feedback problems for graphs with bounded tree-width ⋮ Unnamed Item ⋮ On some optimization problems on \(k\)-trees and partial \(k\)-trees
This page was built for publication:
