How to make a digraph strongly connected
- 1 June 1981
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 1 (2) , 145-153
- https://doi.org/10.1007/bf02579270
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A Minimax Theorem for Directed GraphsJournal of the London Mathematical Society, 1978
- ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMSJournal of the Operations Research Society of Japan, 1978
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- On two minimax theorems in graphJournal of Combinatorial Theory, Series B, 1976