Results 81 to 90 of about 2,549 (154)
Space Saving by Dynamic Algebraization
, 2014 Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually exponential in the treewidth.
A. Björklund +16 more
core +1 more source
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]
Algorithmica, 2022 Gąsieniec L, Klasing R, Radzik T.
europepmc +1 more source
DAG-Pathwidth: Graph Algorithmic Analyses of DAG-Type Blockchain Networks
, 2023 Shoji KASAHARA +3 more
openalex +2 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
Treewidth and Pathwidth Parameterized by the Vertex Cover Number
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chapelle, Mathieu +3 more
openaire +3 more sources
Two Results on Layered Pathwidth and Linear Layouts
, 2021 Vida Dujmović, Pat Morin, Céline Yelle
openalex +1 more source
Embeddings of k-Connected Graphs of Pathwidth k
, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gupta, Arvind +3 more
openaire +1 more source
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path
, 2023 Meike Hatzel +5 more
openalex +2 more sources
Approximating Pathwidth for Graphs of Small Treewidth [PDF]
, 2022 Carla Groenland +3 more
openalex +1 more source
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