Multi-Terminal 0–1 Flow

DOI10.1137/0208033zbMath0419.90077OpenAlexW1988910365MaRDI QIDQ3853461

Yossi Shiloach

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

zbMATH Keywords

computational complexitypolynomial time algorithmundirected network0-1 integer flowmultiterminal flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Related Items (1)

k-Level Crossing Minimization Is NP-Hard for Trees

This page was built for publication: Multi-Terminal 0–1 Flow