✦ LIBER ✦

Packing cuts in undirected graphs

✍ Scribed by Alberto Caprara; Alessandro Panconesi; Romeo Rizzi

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 160 KB
Volume: 44
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing Cycles in Graphs

✍ Guoli Ding; Wenan Zang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 267 KB

Packing Odd Circuits in Eulerian Graphs

✍ James F. Geelen; Bertrand Guenin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Let C be the clutter of odd circuits of a signed graph ðG; SÞ: For nonnegative integral edge-weights w; we are interested in the linear program minðw t x: xðCÞ51; for C 2 C; and x50Þ; which we denote by (P). The problem of solving the related integer program clearly contains the maximum cut problem,

T-joins intersecting small edge-cuts in

T-joins intersecting small edge-cuts in graphs

✍ Tomáš Kaiser; Riste Škrekovski 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

## Abstract In an earlier paper 3, we studied cycles in graphs that intersect all edge‐cuts of prescribed sizes. Passing to a more general setting, we examine the existence of __T__‐joins in grafts that intersect all edge‐cuts whose size is in a given set __A__ ⊆{1,2,3}. In particular, we character

On the All-Pairs-Shortest-Path Problem i

On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs

✍ R. Seidel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 318 KB

We present an algorithm, APD, that solves the distance version of the all-pairs-shortest-path problem for undirected, unweighted \(n\)-vertex graphs in time \(O(M(n) \log n)\), where \(M(n)\) denotes the time necessary to multiply two \(n \times n\) matrices of small integers (which is currently kno

Covering and packing in graphs IV: Linea

Covering and packing in graphs IV: Linear arboricity

✍ Jin Akiyama; Geoffrey Exoo; Frank Harary 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

Edge-Disjoint (s, t)-Paths in Undir

Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time

✍ Karsten Weihe 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 279 KB

We consider the following problem. Let G s V, E be an undirected planar graph and let s, t g V, s / t. The problem is to find a set of pairwise edge-disjoint paths in G, each connecting s with t, of maximum cardinality. In other words, the problem is to find a maximum unit flow from s to t. The fast