Spanning Tree Congestion and Computation of Generalized Gy\H{o}ri-Lov{\'{a}}sz Partition Article Swipe

MAKE IMPACT

L. Sunil Chandran , Yun Kuen Cheung , Davis Issac · YOU? · · 2018 · Open Access ·

We study a natural problem in graph sparsification, the Spanning Tree Congestion (\STC) problem. Informally, the \STC problem seeks a spanning tree with no tree-edge \emph{routing} too many of the original edges. The root of this problem dates back to at least 30 years ago, motivated by applications in network design, parallel computing and circuit design. Variants of the problem have also seen algorithmic applications as a preprocessing step of several important graph algorithms. For any general connected graph with $n$ vertices and $m$ edges, we show that its STC is at most $\mathcal{O}(\sqrt{mn})$, which is asymptotically optimal since we also demonstrate graphs with STC at least $\Omega(\sqrt{mn})$. We present a polynomial-time algorithm which computes a spanning tree with congestion $\mathcal{O}(\sqrt{mn}\cdot \log n)$. We also present another algorithm for computing a spanning tree with congestion $\mathcal{O}(\sqrt{mn})$; this algorithm runs in sub-exponential time when $m = \omega(n \log^2 n)$. For achieving the above results, an important intermediate theorem is \emph{generalized Gy\H{o}ri-Lov\'{a}sz theorem}, for which Chen et al. gave a non-constructive proof. We give the first elementary and constructive proof by providing a local search algorithm with running time $\mathcal{O}^*\left( 4^n \right)$, which is a key ingredient of the above-mentioned sub-exponential time algorithm. We discuss a few consequences of the theorem concerning graph partitioning, which might be of independent interest. We also show that for any graph which satisfies certain \emph{expanding properties}, its STC is at most $\mathcal{O}(n)$, and a corresponding spanning tree can be computed in polynomial time. We then use this to show that a random graph has STC $\Theta(n)$ with high probability.

Type

preprint

Language

en

Landing Page

http://arxiv.org/abs/1802.07632

PDF

https://arxiv.org/pdf/1802.07632

OA Status

green

Related Works

20

OpenAlex ID

https://openalex.org/W2789156753

Raw OpenAlex JSON

OpenAlex ID

https://openalex.org/W2789156753

Canonical identifier for this work in OpenAlex

Title

Spanning Tree Congestion and Computation of Generalized Gy\H{o}ri-Lov{\'{a}}sz Partition

Work title

Type

preprint

OpenAlex work type

Language

en

Primary language

Publication year

2018

Year of publication

Publication date

2018-02-21

Full publication date if available

Authors

L. Sunil Chandran, Yun Kuen Cheung, Davis Issac

List of authors in order

Landing page

https://arxiv.org/abs/1802.07632

Publisher landing page

PDF URL

https://arxiv.org/pdf/1802.07632

Direct link to full text PDF

Open access

Yes

Whether a free full text is available

OA status

green

Open access status per OpenAlex

OA URL

https://arxiv.org/pdf/1802.07632

Direct OA link when available

Concepts

Combinatorics, Spanning tree, Mathematics, Omega, Minimum spanning tree, Discrete mathematics, Partition (number theory), Binary logarithm, Graph, Physics, Quantum mechanics

Top concepts (fields/topics) attached by OpenAlex

Cited by

0

Total citation count in OpenAlex

Related works (count)

20

Other works algorithmically related by OpenAlex

Full payload