Two-trees optimal T-join and integral packing of T-cuts

DOI10.1006/JCTB.1994.1051MaRDI QIDQ1333320zbMATH OpenOpenAlexFDO

Authors Ephraim Korach

Publication date 2 March 1995

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.1994.1051

zbMATH Keywords

\(T\)-joinpackingmulticommodity flow\(T\)-cut

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 927076
• On packing \(T\)-cuts
• On shortest T-joins and packing T-cuts

Cited in

(17)

• Tight integral duality gap in the Chinese postman problem
• Packing odd T‐joins with at most two terminals
• On the integral 4-packing of \(T\)-cuts
• On T-joins and odd factors
• Fractional Packing ofT-Joins
• Vertex set partitions preserving conservativeness
• scientific article; zbMATH DE number 927076 (Why is no real title available?)
• A quick proof of Seymour's theorem on t-joins
• \(T\)-joins in infinite graphs
• Packing six \(T\)-joins in plane graphs
• Minimum T-cuts and optimal T-pairings
• Finding thet-join structure of graphs
• scientific article; zbMATH DE number 1757969 (Why is no real title available?)
• On dyadic fractional packings of \(T\)-joins
• T‐joins intersecting small edge‐cuts in graphs
• On shortest T-joins and packing T-cuts
• Minimum \(T\)-joins and signed-circuit covering

This page was built for publication: Two-trees optimal \(T\)-join and integral packing of \(T\)-cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333320)