Increasing digraph arc-connectivity by arc addition, reversal and complement

Authors:
Esther M. Arkin;Refael Hassin;Shimon Shahar
Affiliations:
Department of Applied Mathematics and Statistics, State University of New York, Stony Brook, NY;School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel;Department of Computer Science, Technion - Israel Institute of Technology, Haifa 32000, Israel
Venue:
Discrete Applied Mathematics
Year:
2002

Citing 7
Cited 1

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
A matroid approach to finding edge connectivity and packing arborescences

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Augmenting graphs to meet edge-connectivity requirements

SIAM Journal on Discrete Mathematics
Centroids, representations, and submodular flows

SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs

SIAM Journal on Discrete Mathematics
Connectivity and network flows

Handbook of combinatorics (vol. 1)
Approximation algorithms for finding highly connected subgraphs

Approximation algorithms for NP-hard problems

Parameterized Complexity of Arc-Weighted Directed Steiner Problems

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper deals with increasing the arc-connectivity of directed graphs by arc additions, reversals or complements. We study several optimization problems, which differ in their arc-connectivity requirements defined by the set of sources, the set of targets and the arc-connectivity value.