On the complexity of circulations

DOI10.1016/0196-6774(86)90042-8MaRDI QIDQ3740229zbMATH OpenOpenAlexFDO

Authors Esther M. Arkin, Christos 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

feasible real-valued circulationmixed graphsNP-completepolynomial-time algorithmundirected graphs

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)

Recommendations

• scientific article; zbMATH DE number 4077435
• scientific article; zbMATH DE number 3904637
• Flows on networks and complicated domains
• The Complexity of Complexity
• scientific article; zbMATH DE number 3868372
• Dynamics of complexity of intersections
• Complexity and irreducibility of dynamics on networks of networks
• On circular flows of graphs
• The complexity of distributions
• Complexity of the circulant foliation over a graph

Cited in

(2)

• On negative cycles in mixed graphs
• On the Circuit Cover Problem for Mixed Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740229)