scientific article
From MaRDI portal
Publication:4036591
zbMath0764.68122MaRDI QIDQ4036591
Jens Lagergren, Stefan Arnborg
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Paths and cycles (05C38)
Related Items
Computing Tree Decompositions, The monadic second order logic of graphs. VI: On several representations of graphs by relational structures, Minor‐order obstructions for the graphs of vertex cover 6, Approximate tree decompositions of planar graphs in linear time, Testing superperfection of k-trees, Obstructions to within a few vertices or edges of acyclic, Fixed-Parameter Tractability of Treewidth and Pathwidth, Approximation algorithms for treewidth, A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth, Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs, Characterizing width two for variants of treewidth, Constructive linear time algorithms for branchwidth, The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues, Finding branch-decompositions of matroids, hypergraphs, and more, \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions, Unnamed Item, A lower bound for treewidth and its consequences, Typical sequences revisited -- computing width parameters of graphs, Unnamed Item, Treewidth and pathwidth of permutation graphs, Parallel algorithms with optimal speedup for bounded treewidth, Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization, Derivation of algorithms for cutwidth and related graph layout parameters, On computing graph minor obstruction sets, Algorithms and obstructions for linear-width and related search parameters, Finding Branch-Decompositions of Matroids, Hypergraphs, and More, Reduction algorithms for graphs of small treewidth, Unnamed Item, Myhill-Nerode Methods for Hypergraphs
