On the time required to detect cycles and connectivity in graphs
- 1 March 1972
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 6 (1-2) , 103-106
- https://doi.org/10.1007/bf01706081
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- A New Method of Checking the Consistency of Precedence MatricesJournal of the ACM, 1959