Very Simple Methods for All Pairs Network Flow Analysis
- 1 February 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (1) , 143-155
- https://doi.org/10.1137/0219009
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Finding the edge connectivity of directed graphsJournal of Algorithms, 1989
- A Graph Theoretic Approach to Statistical Data SecuritySIAM Journal on Computing, 1988
- Multi-terminal maximum flows in node-capacitated networksDiscrete Applied Mathematics, 1986
- Constrained Optimum Communication Trees and Sensitivity AnalysisSIAM Journal on Computing, 1984
- Multiterminal flows in outerplanar networksJournal of Algorithms, 1983
- Circular Cuts in a NetworkMathematics of Operations Research, 1980
- Optimum Communication Spanning TreesSIAM Journal on Computing, 1974
- Optimal Linear OrderingSIAM Journal on Applied Mathematics, 1973
- Sensitivity Analysis of Multiterminal Flow NetworksOperations Research, 1964
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961