论文信息 - Increasing digraph arc-connectivity by arc addition, reversal and complement

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

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.

Esther M. Arkin | Refael Hassin | Shimon Shahar

[1] A. Frank. An Algorithm for Submodular Functions on Graphs , 1982 .

[2] András Frank. Augmenting Graphs to Meet Edge-Connectivity Requirements , 1992, SIAM J. Discret. Math..

[3] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[4] András Frank,et al. Connectivity and network flows , 1996 .

[5] Robert E. Tarjan,et al. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[6] S Fujishige,et al. A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows , 1996 .

[7] Harold N. Gabow. A matroid approach to finding edge connectivity and packing arborescences , 1991, STOC '91.

[8] Harold N. Gabow. Centroids, Representations, and Submodular Flows , 1995, J. Algorithms.

[9] Richard T. Wong,et al. A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[10] S. Khuller. Approximation algorithms for finding highly connected subgraphs , 1996 .

[11] R. Graham,et al. Handbook of Combinatorics , 1995 .

[12] András Frank,et al. Preserving and Increasing Local Edge-Connectivity in Mixed Graphs , 1995, SIAM J. Discret. Math..