Linear expected-time algorithms for connectivity problems
Authors:
- Richard M KarpRKRichard M Karp
- Robert Endre TarjanRTRobert Endre Tarjan
- 1 December 1980
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 1 (4) , 374-393
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman ProblemSIAM Journal on Computing, 1979
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- An Algorithm for Transitive Closure with Linear Expected TimeSIAM Journal on Computing, 1978
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- On sparse graphs with dense long pathsComputers & Mathematics with Applications, 1975
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957