Augmentation Problems
- 1 December 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 5 (4) , 653-665
- https://doi.org/10.1137/0205044
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Finding optimum branchingsNetworks, 1977
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- A note on finding the bridges of a graphInformation Processing Letters, 1974
- On the hamiltonian completion problemLecture Notes in Mathematics, 1974
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Connectivity considerations in the design of survivable networksIEEE Transactions on Circuit Theory, 1970
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967