Results 151 to 160 of about 3,161 (171)
Some of the next articles are maybe not open access.
Large induced subgraph with a given pathwidth in outerplanar graphs
arXiv.orgA long-standing conjecture by Albertson and Berman states that every planar graph of order $n$ has an induced forest with at least $\lceil \frac{n}{2} \rceil$ vertices.
Naoki Matsumoto, Takamasa Yashima
semanticscholar +1 more source
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
International Colloquium on Automata, Languages and Programming, 2019We investigate the locality number, a recently introduced structural parameter for strings (with applications in pattern matching with variables), and its connection to two important graph-parameters, cutwidth and pathwidth. These connections allow us to
Katrin Casel +5 more
semanticscholar +1 more source
Pathwidth of Planar and Line Graphs
Graphs and Combinatorics, 2003The paper studies the pathwidth \(\text{pw}(G)\) of planar graphs and proves that for any 2-connected plane graph \(G\) with pathwidth \(\text{pw}(G^*)\) of the geometric dual graph \(G^*\) of \(G\) is smaller than the pathwidth \(\text{pw}(L(G))\) of the line graph \(L(G)\) of \(G\).
openaire +2 more sources
treewidth pathwidth and cospan decompositions
Electronic Communication of The European Association of Software Science and Technology, 2011OA ...
Blume, Christoph +3 more
openaire +2 more sources
Revisiting Space in Proof Complexity: Treewidth and Pathwidth
2013So-called ordered variants of the classical notions of pathwidth and treewidth are introduced and proposed as proof theoretically meaningful complexity measures for the directed acyclic graphs underlying proofs. The ordered pathwidth of a proof is shown to be roughly the same as its formula space.
Moritz Mýller, Stefan Szeider
openaire +4 more sources
A Linear Algorithm for the Pathwidth of Trees
1990The pathwidth is a graph parameter only recently studied but closely related to other characteristics of graphs like tree, band- or cutwidth, interval thickness or search number ([S]). The graphs considered here are finite, undirected and simple. First the preliminaries are given. Section 2 contains our main results on the pathwidth of trees, the basis
openaire +2 more sources
Faster algorithm for pathwidth one vertex deletion
Theoretical Computer Science, 2022Dekel Tsur
semanticscholar +1 more source
Horton-Strahler number, rooted pathwidth and upward drawings of trees
Information Processing Letters, 2021T. Biedl
semanticscholar +1 more source