An algorithm for labeling network flow problems

zbMATH Open1171.90347MaRDI QIDQ5324604FDOQ5324604

Authors: Vinai Kumar Singh, Thekke Madam Nimisha 

Publication date: 3 August 2009

Recommendations

• scientific article; zbMATH DE number 29758
• Constructing maximal dynamic flows from static flows
• scientific article; zbMATH DE number 4204092
• scientific article; zbMATH DE number 1953188
• scientific article; zbMATH DE number 150473

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cited In (3)

• Algorithms for placing monitors in a flow network
• Network as a Computer: Ranking Paths to Find Flows
• The problem of maximum flow with minimum attainable cost in a network

This page was built for publication: An algorithm for labeling network flow problems

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