Results 81 to 90 of about 2,587 (156)
On the Pathwidth of Hyperbolic 3-Manifolds
, 2021 Computing in Geometry and Topology, Vol. 1 No. 1 (2022)
openaire +4 more sources
Metric Embedding via Shortest Path Decompositions
, 2019 We study the problem of embedding shortest-path metrics of weighted graphs into $\ell_p$ spaces. We introduce a new embedding technique based on low-depth decompositions of a graph via shortest paths.
Abraham, Ittai +3 more
core
Polynomial bounds for pathwidth
Dallard, Milanič, and Štorgel conjectured that for a hereditary graph class $\mathcal{G}$, if there is some function $f:\mathbb{N}\to\mathbb{N}$ such that every graph $G\in \mathcal{G}$ with clique number $ω(G)$ has treewidth at most $f(ω(G))$, then there is a polynomial function $f$ with the same property.
openaire +2 more sources
Optimal local certification on graphs of bounded pathwidth [PDF]
Dan Alden Baterisna, Yi‐Jun Chang
openalex +3 more sources
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path [PDF]
, 2023 Meike Hatzel +5 more
openalex +1 more source
Grundy Distinguishes Treewidth from Pathwidth [PDF]
, 2020 Rémy Belmonte +4 more
openalex +1 more source
Tree-decompositions of small pathwidth
Electronic Notes in Discrete Mathematics, 2001 The treewidth \(\text{ tw}(G)\) of \(G\) can be defined as minimum width of a tree-decomposition of \(G\), or minimum \(\omega(H)-1\) of a chordal triangulation \(H\) of \(G\). Similarely, the pathwidth \(\text{ pw}(G)\) can be defined via path-decompositions or triangulations into interval graphs. Thereby a path-decomposition is a tree-decomposition \(
openaire +2 more sources
Protocol for aerosolization challenge of mice with Bordetella pertussis. [PDF]
STAR Protoc, 2023 Bitzer G +3 more
europepmc +1 more source
Two Results on Layered Pathwidth and Linear Layouts
, 2021 Vida Dujmović, Pat Morin, Céline Yelle
openalex +1 more source
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Algorithmica, 2023 Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source