Greedy packing and series-parallel graphs

DOI10.1016/0097-3165(88)90039-8zbMath0657.05069OpenAlexW2079689662MaRDI QIDQ1110543

Alan C. Tucker, Alan J. Hoffman

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0097-3165(88)90039-8

zbMATH Keywords

series-parallel graphlinear programming problemdirected multigraphsingle sinksingle source

Mathematics Subject Classification ID

Linear programming (90C05) Graph theory (05C99)

Related Items

Functions computed by monotone Boolean formulas with no repeated variables, On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint, The edge versus path incidence matrix of series-parallel graphs and greedy packing

Cites Work

• Minimum cost flow algorithms for series-parallel networks
• Unnamed Item