Directed cut transversal packing for source-sink connected graphs

Feofiloff, Paulo; Younger, D. H.

doi:10.1007/bf02579302

Cited by 20 publications

(24 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In particular, Figure 1 shows that the Edmonds-Giles Conjecture is not true for planar digraphs. On the other hand, the conjecture was verified for series-parallel digraphs [8] (see also [10], [3], [4] which proves the conjecture for source-sink connected digraphs). In this paper we narrow the gap between these two results by working on the planar dual problem.…”

Section: Introductionmentioning

confidence: 81%

Packing Dicycle Covers in Planar Graphs with No K 5–e Minor

Lee

Williams

2006

LATIN 2006: Theoretical Informatics

View full text Add to dashboard Cite

Abstract. We prove that the minimum weight of a dicycle is equal to the maximum number of disjoint dicycle covers, for every weighted digraph whose underlying graph is planar and does not have K5 − e as a minor (K5 − e is the complete graph on five vertices, minus one edge). Equality was previously known when forbidding K4 as a minor, while an infinite number of weighted digraphs show that planarity does not guarantee equality. The result also improves upon results known for Woodall's Conjecture and the Edmonds-Giles Conjecture for packing dijoins. Our proof uses Wagner's characterization of planar 3-connected graphs that do not have K5 − e as a minor.

show abstract

Section: Introductionmentioning

confidence: 81%

Packing Dicycle Covers in Planar Graphs with No K 5–e Minor

Lee

Williams

2006

LATIN 2006: Theoretical Informatics

View full text Add to dashboard Cite

show abstract

“…Schrijver [7] Moreover, the weight of each directed cuts has not changed. Similarly, Theorem 1.2 can be restated [4]. A directed cut, δ(M ), is a side cut, if every source is in M , or no sink is in M .…”

Section: Introductionmentioning

confidence: 99%

“…Using different techniques, Schrijver [2], Feofiloff [3], and Feofiloff and Younger [4] have proven a significant special case of Conjecture 1.1. A node s is a source or sink, if δ({s}) or δ(N − {s}) is a directed cut, respectively.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Advances in packing directed joins

Williams¹,

Guenin²

2005

Electronic Notes in Discrete Mathematics

View full text Add to dashboard Cite

“…The minimum cardinality of a directed cut equals the maximum cardinality of a collection of disjoint dijoins. Schrijver (1982) and Feofiloff and Younger (1987) verified the conjecture (even in the weighted case) if the digraph is source-sink connected, that is, there is a directed path from each source to each sink. Note that restricting the conjecture to planar graphs, and then translating to the dual map, one has the following question which is also open.…”

Section: Introductionmentioning

confidence: 71%

Visualizing, Finding and Packing Dijoins

Shepherd¹,

Vetta²

Graph Theory and Combinatorial Optimization

View full text Add to dashboard Cite

We consider the problem of making a directed graph strongly connected. To achieve this, we are allowed for assorted costs to add the reverse of any arc. A successful set of arcs, called a dijoin, must intersect every directed cut. Lucchesi and Younger gave a min-max theorem for the problem of finding a minimum cost dijoin. Less understood is the extent to which dijoins pack. One difficulty is that dijoins are not as easily visualized as other combinatorial objects such as matchings, trees or flows. We give two results which act as visual certificates for dijoins. One of these, called a lobe decomposition, resembles Whitney's ear decomposition for 2-connected graphs. The decomposition leads to a natural optimality condition for dijoins. Based on this, we give a simple description of Frank's primal-dual algorithm to find a minimum dijoin. Our implementation is purely primal and only uses greedy tree growing procedures. It runtime is O(n 2 m), matching the best known, due to Gabow. We then consider the function f (k) which is the maximum value such that every weighted directed graph whose minimum weight of a directed cut is at least k, admits a weighted packing of f (k) dijoins (a weighted packing means that the number dijoins containing an arc is at most its weight). We ask whether f (k) approaches infinity. It is not yet known whether f (k 0 ) ≥ 2 for some constant k 0 . We consider a concept of skew submodular flow polyhedra and show that this dijoinpair question reduces to finding conditions on when their integer hulls are non-empty. We also show that for any k, there exists a half-integral dijoin packing of size k 2 . 2 IntroductionWe consider the basic problem of strengthening a network D = (V, A) so that it becomes strongly connected. That is, we require that there be a directed path between any pair of nodes in both directions. To achieve this goal we are allowed to add to the graph (at varying costs) the complements of some of the network arcs. Equivalently, we are searching for a collection of arcs that induce a strongly connected graph when they are either contracted or made bi-directional. It is easy to see that our problem is that of finding a dijoin, a set of arcs that intersects every directed cut.Despite its fundamental nature, the minimum cost dijoin problem is not a standard modelling tool for the combinatorial optimizer in the same way that shortest paths, matchings and network flows are. We believe that widespread adoption of these other problems stems from the fact that they can be tackled using standard concepts such as dynamic programming, greedy algorithms, shrinking, and tree growing. Consequently, simple and efficient algorithms can be implemented and also, importantly, taught. One objective of this paper, therefore, is to examine dijoins using classical combinatorial optimization techniques such as decomposition, arborescence growing and negative cycle detection. Under this framework, we present a primal version of Frank's seminal primal-dual algorithm for finding a minimum cost d...

show abstract

Directed cut transversal packing for source-sink connected graphs

Cited by 20 publications

References 7 publications

Packing Dicycle Covers in Planar Graphs with No K 5–e Minor

Packing Dicycle Covers in Planar Graphs with No K 5–e Minor

Advances in packing directed joins

Visualizing, Finding and Packing Dijoins

Contact Info

Product

Resources

About