Maximum network flow with floating point arithmetic.

DOI10.1016/S0020-0190(98)00043-XzbMath1078.68670MaRDI QIDQ2583544

Kurt Mehlhorn, Ernst Althaus

Publication date: 17 January 2006

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

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)

Related Items (2)

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems ⋮ Trustworthy Graph Algorithms (Invited Talk)

Uses Software

• LEDA

Cites Work

• A new approach to the maximum-flow problem
• Unnamed Item

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