Skip to content
#edge computing Preprint

Path Decompositions of Sparse Graphs via Gaussian Sweeps and Faster Exponential Algorithms

Nov 2026 · 0 citations
Computer Science Mathematics

TL;DR

The probability that a vertex lies in a frontier by comparison with an explicit Gaussian model of a vertex and its neighbors is bound by comparison with an explicit Gaussian model of a vertex and its neighbors.

Abstract

Using the bisection bound of Monien and Preis, Fomin and H{\o}ie proved in 2006 that every graph of maximum degree 3 on $n$ vertices has pathwidth at most $n/6+o(n)$. We prove that the pathwidth, bisection width and cutwidth of these graphs are at most $c_3 n+o(n)$, where $c_3=\frac{3}{4\pi}\arccos\frac56\approx0.1398$. For bisection width this improves the bound $n/6+o(n)$ of Monien and Preis (2006) and extends to all such graphs the bound that Lichev and Mitsche (2023) obtained for random cubic graphs. For maximum degree 4, we prove that bisection width and cutwidth are at most $n/3+o(n)$, improving the bound $2n/5+o(n)$ of Monien and Preis for 4-regular graphs, and that pathwidth is at most $0.2458n$, improving the bound $n/3$ of Fomin, Gaspers, Saurabh and Stepanov (2009). We show that every graph with $m$ edges has pathwidth at most $7m/48+o(n)$, improving the bound $13m/75$ of Scott and Sorkin (2007), and we give further bounds of the form $\sum_{d\ge3}a_d n_d+o(n)$ with $a_d<1$, where $n_d$ is the number of vertices of degree $d$. The path decompositions, and linear orderings of the stated cutwidth, can be computed in polynomial time. Instead of deriving pathwidth bounds from bisection width, we give each vertex a Gaussian label, a weighted sum of independent standard normal variables over a ball around it, and sweep a threshold through the labels; the bags are frontiers, the vertices above the threshold with a neighbor below it. We bound the probability that a vertex lies in a frontier by comparison with an explicit Gaussian model of a vertex and its neighbors. Faster exact algorithms follow: for feedback vertex set and the traveling salesperson problem on graphs of bounded maximum or average degree, and on general graphs for minimum weight dominating set (by branching until the instance is sparse), Max 2-CSP and counting subgraphs with $k$ edges (by the bound in $m$).

View source

Similar papers

Preprint Oct 2026

Sharp lower bounds for bisections of graphs with bounded maximum degree

A bisection of a graph is a partition of its vertex set into two parts whose sizes differ by at most one. We prove that every graph with $m$ edges and maximum degree at most $k$ has a bisection of size at least $\frac{k+1}{2k}m$ when $k$ is odd, and at least $\frac{k+2}{2(k+1)}m$ when $k$ is even. Both bounds are sharp...

Qi-Wen Guo, G. Gutin · 2 citations
Preprint Oct 2026

Directed Global Minimum Cut in Almost-Linear Time

We give a randomized reduction from global minimum cut in a directed graph with $n$ vertices and $m$ weighted edges to maximum-flow computations on graphs of total size $\widetilde{O}(m)$. For polynomially bounded integral weights, this yields the first almost-linear $m^{1+o(1)}$-time algorithm [vdBCK+23], improving th...

Henry L. Fleischmann, Jason Li, Thatchaphol Saranurak et al. · 3 citations · ⚡1
Preprint Sep 2026

An improved bound on the treewidth of planar graphs excluding a grid minor

We show that every planar graph with no $t \times t$ grid minor has treewidth at most $4t +4$. This improves on the previously best known bound of $\frac{9}{2}t - \frac{11}{2}$, due to Gu and Tamaki (2012), and is within a factor $2$ of optimal. A key step in the proof is showing the following result, which might be of...

Wouter Cames van Batenburg, Quentin Claus, G. Joret et al. · 0 citations
Preprint Sep 2026

Bounded chromatic number of graphs with small clique number and large minimum degree

We prove that every triangle-free graph with minimum degree at least $\frac{n}{3}$ is $4$-colorable and thereby settle a problem of Brandt and Thomass\'e (2005) at the threshold $\frac{n}{3}$. The number four is best possible. For a positive integer-valued function $f(n)=o(n)$, we relate the chromatic number of $f(n)$-...

Jia-Ao Li, Xin-Yuan Li · 0 citations
Preprint Oct 2026

Approximating the Girth of an Undirected, Weighted Graph for Larger Approximation Factors

The girth of a weighted undirected graph is defined as the length of a shortest cycle in the graph. In this paper, we give a randomized $O\left(m^{1+2/(k-1)} n^{1/(k-1)}\right)$ algorithm to approximate the girth of a graph with $n$ vertices and $m$ edges to within a factor of $k$ for any real $k$. We assume that all e...

Eliyahu Yablon · 0 citations
Preprint Oct 2026

Deterministic Girth Approximation in Weighted Undirected Graphs

We give deterministic algorithms for approximating the girth~$g$ of an undirected graph with $n$ vertices, $m$ edges, and nonnegative real edge lengths. For every integer $k\geq2$, our algorithm returns a cycle of length at most $\frac{2k}{3}g$ in $O((m+n^{1+2/k})k\log n)$ worst-case time. For every constant~$k$, this...

Avi Kadria · 1 citation

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.