On extremal multiflows
From MaRDI portal
Publication:1850477
DOI10.1006/JCTB.2000.1958zbMATH Open1025.05049OpenAlexW2034590356MaRDI QIDQ1850477FDOQ1850477
Authors: Hagai Ilani, Ephraim Korach, Michael V. Lomonosov 
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2000.1958
Recommendations
Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Matching theory
- A theorem on flows in networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Über die Maximalzahl kantendisjunkter A-Wege
- Combinatorial approaches to multiflow problems
- On Integer Multiflow Maximization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum balanced flow in a network
Cited In (14)
- On return path packing.
- Path packing and a related optimization problem
- Title not available (Why is that?)
- On ideal clutters, metrics and multiflows
- On multiflow lexicographics
- Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
- On the fractionality of the path packing problem
- On extremes and streams of upcrossing.
- Free multiflows in bidirected and skew-symmetric graphs
- (Almost) tight bounds and existence theorems for confluent flows
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum balanced flow in a network
This page was built for publication: On extremal multiflows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850477)
