scientific article; zbMATH DE number 1953081

MaRDI QIDQ4414484zbMATH OpenFDO

Authors Franz J. Brandenburg

Publication date 25 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2573/25730047.htm

Mathematics Subject Classification ID

Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3845308
• Faster algorithms for the generalized network flow problem
• Negative-cycle detection algorithms
• Negative-cycle detection algorithms
• Shortest path and maximum flow problems in networks with additive losses and gains

Cited in

(8)

• Cyclic networks with general blocking and starvation
• Inducing Measures by Cyclic Networks
• scientific article; zbMATH DE number 5532145 (Why is no real title available?)
• Statistics of cycles: how loopy is your network?
• Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
• scientific article; zbMATH DE number 6783443 (Why is no real title available?)
• Erratum to: ``Cycles in generalized networks
• Shortest path and maximum flow problems in networks with additive losses and gains

This page was built for publication:

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