Network Flow and Testing Graph Connectivity
- 1 December 1975
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 4 (4) , 507-518
- https://doi.org/10.1137/0204043
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal FlowsJournal of the ACM, 1972
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961
- Zur allgemeinen KurventheorieFundamenta Mathematicae, 1927