✦ LIBER ✦

On shortest T-joins and packing T-cuts

✍ Scribed by A.M.H Gerards

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 516 KB
Volume: 55
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90032-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Packing T-Cuts

✍ A. Frank; Z. Szigeti 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 355 KB

Notes On Packing \(T\)-Cuts* András Frank \({ }^{\dagger}\) Research Institute for Discrete Mathematics, University of Bonn, Nassestr. 2, Bonn-1, Germany, D-5300 Received July 2, 1992 A short proof of a difficult theorem of P. D. Seymour on grafts with the max-flow

Two-Trees Optimal T-Join and Integral Pa

Two-Trees Optimal T-Join and Integral Packing of T-Cuts

✍ E. Korach 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Let \(G\) be an undirected graph, \(T\) an even subset of vertices and \(F\) an optimal \(T\)-join, which is a forest of two trees. The main theorem of this paper characterizes the cases, where \((G, T)\) has an optimal packing of \(T\)-cuts which is integral. This theorem unifies and generalizes a

On the integral 4-packing of T-cuts

✍ Frieda Granot; Michal Penn 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 777 KB

Let C = (V, E) be an undirected graph, w : E + Z' a weight function and T c V an even subset of vertices from G. A T-cut is an edge-cut set which divides T into two odd sets. For ( Tj = 4 Seymour gave a good characterization of the graphs for which there exists a maximum packing of T-cuts that is in

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

A quick proof of Seymour's theorem on t-

A quick proof of Seymour's theorem on t-joins

✍ András Sebö 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 163 KB

A very short proof of Seymour's theorem, stating that in bipartite graphs the minimum cardinality of a t-join is equal to the maximum cardinality of an edge-disjoint packing of t-cuts, is given. Let G be a graph and t:V(G)-, {0, 1}, where t(V(G)) is even. (If X~\_ V(G), then t(X):=E {t(x):xeX}.) A

New officers and directors join ASIS&T b

New officers and directors join ASIS&T board

📂 Article 📅 2009 🏛 American Society for Information Science and Techn 🌐 English ⚖ 293 KB

E very year at the ASIS&T Annual Meeting, a new administrative year begins, and the first official order of business is the introduction of new faces to the ASIS&T Board of Directors. In October in Columbus, the annual changing of the guard took place, and new officers and directors took their seats