A Unified Approach to Path Problems
- 1 July 1981
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 28 (3), 577-593
- https://doi.org/10.1145/322261.322272
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Fast Algorithms for Solving Path ProblemsJournal of the ACM, 1981
- Algebraic structures for transitive closureTheoretical Computer Science, 1977
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- A Shortest Path Algorithm for Edge-Sparse GraphsJournal of the ACM, 1976
- Global Data Flow Analysis and Iterative AlgorithmsJournal of the ACM, 1976
- A Fast and Usually Linear Algorithm for Global Flow AnalysisJournal of the ACM, 1976
- Triangular factorization and inversion by fast matrix multiplicationMathematics of Computation, 1974
- Two Complete Axiom Systems for the Algebra of Regular EventsJournal of the ACM, 1966
- A Theorem on Boolean MatricesJournal of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959