On reversing arcs to improve arc-connectivity

05/02/2023
by   Pierre Hoppenot, et al.
0

We show that if the arc-connectivity of a directed graph D is at most ⌊k+1/2⌋ and the reorientation of an arc set F in D results in a k-arc-connected directed graph then we can reorient one arc of F without decreasing the arc-connectivity of D. This improves a result of Fukuda, Prodon, Sakuma and one of Ito et al. for k∈{2,3}.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2021

Faster Algorithms for Rooted Connectivity in Directed Graphs

We consider the fundamental problems of determining the rooted and globa...
research
03/19/2023

Connectivity Analysis of Directed Highway VANETs using Graph Theory

Graph theory is a promising approach in handling the problem of estimati...
research
10/19/2021

What is Learned in Knowledge Graph Embeddings?

A knowledge graph (KG) is a data structure which represents entities and...
research
06/24/2019

On Uniquely Registrable Networks

Consider a network with N nodes in d-dimensional Euclidean space, and M ...
research
04/28/2023

Directed hypergraph connectivity augmentation by hyperarc reorientations

The orientation theorem of Nash-Williams states that an undirected graph...
research
09/29/2020

The star-structure connectivity and star-substructure connectivity of hypercubes and folded hypercubes

As a generalization of vertex connectivity, for connected graphs G and T...
research
04/26/2019

On the fixed-parameter tractability of the maximum connectivity improvement problem

In the Maximum Connectivity Improvement (MCI) problem, we are given a di...

Please sign up or login with your details

Forgot password? Click here to reset