DeepAI AI Chat
Log In Sign Up

Sparse highly connected spanning subgraphs in dense directed graphs

01/05/2018
by   Dong Yeap Kang, et al.
0

Mader (1985) proved that every strongly k-connected n-vertex digraph contains a strongly k-connected spanning subgraph with at most 2kn - 2k^2 edges, and this is sharp. For dense strongly k-connected digraphs, the bound can be significantly improved for dense strongly k-connected digraphs. Let Δ(D) be the maximum degree of the complement of the underlying undirected graph of a digraph D. We prove that every strongly k-connected n-vertex digraph D contains a strongly k-connected spanning subgraph with at most kn + 800k(k+Δ(D)) edges. The additional term 800k(k+Δ(D)) is sharp up to a multiplicative constant. In particular, it follows that every strongly k-connected n-vertex semicomplete digraph contains a strongly k-connected spanning subgraph with at most kn + 800k^2 edges, improving the recent result of Kang, Kim, Kim, and Suh (2017) for tournaments and establishing the tight bound, as 800k^2 cannot be improved to the number less than k(k-1)/2. We also prove an analogous result for strongly k-arc-connected directed multigraphs, which generalises the earlier result of Bang-Jensen, Huang, and Yeo (2004) for strongly connected digraphs. The proofs yield polynomial-time algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/26/2022

Identifying a 3-vertex strongly biconnected directed subgraph with minimum number of edges

A strongly connected graph is strongly biconnected if after ignoring the...
08/02/2020

Minimum 2-vertex strongly biconnected spanning directed subgraph problem

A directed graph G=(V,E) is strongly biconnected if G is strongly connec...
07/09/2022

Minimum strongly biconnected spanning directed subgraph problem

Let G=(V,E) be a strongly biconnected directed graph. In this paper we c...
11/11/2020

An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph

In the weighted minimum strongly connected spanning subgraph (WMSCSS) pr...
05/29/2020

Parameterized Complexity of Min-Power Asymmetric Connectivity

We investigate parameterized algorithms for the NP-hard problem Min-Powe...
02/22/2023

Easy testability for posets

Alon and Shapira proved that every class of undirected graphs closed und...
09/24/2019

Random k-out subgraph leaves only O(n/k) inter-component edges

Each vertex of an arbitrary simple graph on n vertices chooses k random ...