Multi-Terminal 0–1 Flow
From MaRDI portal
Publication:3853461
DOI10.1137/0208033zbMath0419.90077MaRDI QIDQ3853461
Publication date: 1979
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0208033
computational complexity; polynomial time algorithm; undirected network; 0-1 integer flow; multiterminal flow
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90B10: Deterministic network models in operations research