Fast Algorithms for Solving Path Problems
- 1 July 1981
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 28 (3), 594-614
- https://doi.org/10.1145/322261.322273
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- A survey of sparse matrix researchProceedings of the IEEE, 1977
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- A Fast and Usually Linear Algorithm for Global Flow AnalysisJournal of the ACM, 1976
- Regular Algebra Applied to Path-finding ProblemsIMA Journal of Applied Mathematics, 1975
- Partitioning, tearing and modification of sparse linear systemsJournal of Mathematical Analysis and Applications, 1974
- Characterizations of Reducible Flow GraphsJournal of the ACM, 1974
- Flow Graph ReducibilitySIAM Journal on Computing, 1972
- An empirical study of FORTRAN programsSoftware: Practice and Experience, 1971
- Control flow analysisACM SIGPLAN Notices, 1970
- Algorithm 97: Shortest pathCommunications of the ACM, 1962