Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings

Therese Biedl; Prosenjit Bose; Karthik Murali

Home/Archive/arXiv

arXiv · 2407.00586

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings

Therese Biedl·Prosenjit Bose·Karthik Murali

View original source ↗Read source document ↗Export metadata ↓

Abstract

Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of this paper is on computing these two parameters for graphs embedded on the plane with crossings. For planar graphs -- which can be embedded on the plane without any crossings -- it has long been known that vertex and edge connectivity can be computed in linear time. Recently, the algorithm for vertex connectivity was extended from planar graphs to 1-plane graphs (where each edge is crossed at most once) without $\times$-crossings -- these are crossings whose endpoints induce a matching. The key insight, for both these classes of graphs, is that any two vertices/edges of a minimum vertex/edge cut have small face-distance (distance measured by number of faces) in the embedding. In this paper, we attempt at a comprehensive generalization of this idea to a wider class of graphs embedded on the plane. Our method works for all those embedded graphs where every pair of crossing edges is connected by a path whose vertices and edges have a small face-distance from the crossing point. Important examples of such graphs include optimal 2-planar and optimal 3-planar graphs, $d$-map graphs, $d$-framed graphs, graphs with bounded crossing number, and $k$-plane graphs with bounded number of $\times$-crossings. For all these graph classes, we get a linear-time algorithm for computing vertex and edge connectivity.

Explore related subjects

cs.DS math.CO

Keep this discovery

BibTeX RIS

Therese Biedl, Prosenjit Bose, Karthik Murali. 2024-06-30. Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings. https://arxiv.org/abs/2407.00586

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗