Approximating pathwidth for graphs of small treewidth
We describe a polynomial-time algorithm which, given a graph G with treewidth t,
approximates the pathwidth of G to within a ratio of. This is the first algorithm to achieve an f …
approximates the pathwidth of G to within a ratio of. This is the first algorithm to achieve an f …
On tree decompositions whose trees are minors
In 2019, Dvořák asked whether every connected graph GG has a tree decomposition (T, B)
(T,\mathcalB) so that TT is a subgraph of GG and the width of (T, B) (T,\mathcalB) is bounded …
(T,\mathcalB) so that TT is a subgraph of GG and the width of (T, B) (T,\mathcalB) is bounded …
[PDF][PDF] Graph Width Parameters. Dependencies, Algorithms and Decompositions.
W Nadara - 2023 - mimuw.edu.pl
This dissertation will be based on results from structural graph theory, mainly revolving
around graph width parameters, dependencies between them, their usages and finding …
around graph width parameters, dependencies between them, their usages and finding …
[PDF][PDF] Graphs with Large Overlap in Their Spanning Trees
P Blanco - pabloblancoh.github.io
The overlap of a spanning tree of a graph is one way to measure how much its fundamental
cycles intersect. In this paper, we show that there is a family of graphs with bounded …
cycles intersect. In this paper, we show that there is a family of graphs with bounded …