On the complexity of circulations

DOI10.1016/0196-6774(86)90042-8zbMath0603.68039OpenAlexW2069849705MaRDI QIDQ3740229

Esther M. Arkin, Christos H. Papadimitriou

Publication date: 1986

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(86)90042-8

zbMATH Keywords

polynomial-time algorithmNP-completemixed graphsundirected graphsfeasible real-valued circulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

On negative cycles in mixed graphs

This page was built for publication: On the complexity of circulations