scientific article
From MaRDI portal
zbMath0764.68108MaRDI QIDQ4036592
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Computing Tree Decompositions, Scheduling with incompatible jobs, Approximate tree decompositions of planar graphs in linear time, Testing superperfection of k-trees, Approximation algorithms for treewidth, Kernelization using structural parameters on sparse graph classes, A simple linear time algorithm for triangulating three-colored graphs, The complexity of broadcasting in planar and decomposable graphs, A lower bound for treewidth and its consequences, Tree-width and path-width of comparability graphs of interval orders, Minor-Closed Graph Classes with Bounded Layered Pathwidth, Unnamed Item, Treewidth and pathwidth of permutation graphs, A simple linear-time algorithm for finding path-decompositions of small width, Mixed searching and proper-path-width, Parallel algorithms with optimal speedup for bounded treewidth, Efficient sets in partial \(k\)-trees, Peptide sequencing via graph path decomposition, The complexity of broadcasting in planar and decomposable graphs, Complexity of path-forming games, Two strikes against perfect phylogeny, Unnamed Item
