Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1808.05256

Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1)

Hemant Malik·Ovidiu Daescu·Ramaswamy Chandrasekaran
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a connected undirected graph G = [V; E] where |E| =2(|V| -1), we present two algorithms to check if G can be decomposed into two edge disjoint spanning trees, and provide such a decomposition when it exists. Unlike previous algorithms for finding edge disjoint spanning trees in general undirected graphs, based on matroids and complex in description, our algorithms are based on simple graph reduction techniques and thus easy to describe and implement. Moreover, the running time for our solutions is asymptotically faster. Specifically, ours are the first algorithms to achieve a running time that is a polylog factor from linear, approaching the 1974 linear time algorithm of Robert E. Tarjan for directed graphs. A direct implication of our result is that minimally rigid graphs, also called Laman graphs, can be recognized in almost linear time, thus answering a long standing open problem.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Hemant Malik, Ovidiu Daescu, Ramaswamy Chandrasekaran. 2018-08-15. Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1). https://arxiv.org/abs/1808.05256

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

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↗