Maximum network flow with floating point arithmetic.

DOI10.1016/S0020-0190(98)00043-XzbMATH Open1078.68670MaRDI QIDQ2583544FDOQ2583544

Authors: Ernst Althaus, K. Mehlhorn 

Publication date: 17 January 2006

Published in: Information Processing Letters (Search for Journal in Brave)

Recommendations

• Improved Time Bounds for the Maximum Flow Problem
• scientific article; zbMATH DE number 177817
• An $o(n^3 )$-Time Maximum-Flow Algorithm
• On the maximum capacity augmentation algorithm for the maximum flow problem
• On the efficiency of maximum-flow algorithms on networks with small integer capacities

zbMATH Keywords

AlgorithmsNetwork flowFloating point arithmetic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Network flows. Theory, algorithms, and applications.
• A new approach to the maximum-flow problem

Cited In (2)

• Linear time approximation algorithms for~degree~constrained subgraph problems
• Trustworthy Graph Algorithms (Invited Talk)

Uses Software

• LEDA

This page was built for publication: Maximum network flow with floating point arithmetic.

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