On maximum flows in polyhedral domains
Open Access
- 1 February 1990
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 40 (1) , 88-123
- https://doi.org/10.1016/0022-0000(90)90020-l
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- The Discrete Geodesic ProblemSIAM Journal on Computing, 1987
- Visibility of disjoint polygonsAlgorithmica, 1986
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Medial Axis Transformation of a Planar ShapePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Maximum flow in (s,t) planar networksInformation Processing Letters, 1981
- Maximum Flow in Planar NetworksSIAM Journal on Computing, 1979
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956