Sparse matrix techniques for the shortest path problem
- 1 December 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 23 (12) , 752-758
- https://doi.org/10.1109/tcs.1976.1084155
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Sur les performances d'algorithmes de recherche de chemins minimaux dans les graphes clairsemésRevue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle, 1974
- On shortest paths and sortingPublished by Association for Computing Machinery (ACM) ,1972
- An Algebra for Network Routing ProblemsIMA Journal of Applied Mathematics, 1971
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- An algorithm for finding shortest routes from all source nodes to a given destination in general networksQuarterly of Applied Mathematics, 1970
- Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear EquationsJournal of the ACM, 1970
- Sparsity-Directed Decomposition for Gaussian Elimination on MatricesIEEE Transactions on Power Apparatus and Systems, 1970
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- The Elimination form of the Inverse and its Application to Linear ProgrammingManagement Science, 1957