Two-trees optimal \(T\)-join and integral packing of \(T\)-cuts

DOI10.1006/jctb.1994.1051zbMath0807.05062OpenAlexW2028092772MaRDI QIDQ1333320

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

packingmulticommodity flow\(T\)-join\(T\)-cut

Mathematics Subject Classification ID

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

Related Items (1)

Vertex set partitions preserving conservativeness

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