Revised Matrix Algorithms for Shortest Paths

Previous article Next article Revised Matrix Algorithms for Shortest PathsT. C. HuT. C. Huhttps://doi.org/10.1137/0115017PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout1 Claude Berge, The theory of graphs and its applications, Translated by Alison Doig, Methuen & Co. Ltd., London, 1962, 138– MR0132541 0097.38903 Google Scholar2 George B. Dantzig, On the shortest route through a network, Management Sci., 6 (1959/1960), 187–190 MR0113815 0995.90518 CrossrefISIGoogle Scholar3 B. A. Farbey, , A. H. Land and , J. D. Marchland, The cascade algorithm for finding the minimum distance, Report, LSE-TNT-19, London School of Economics, 1965 Google Scholar4 L. R. Ford, Jr., Network flow theory, RAND Report, P-923, The RAND Corporation, Santa Monica, California, 1956 Google Scholar5 T. C. Hu, The maximum capacity route problem, Operations Res., 9 (1961), 898–900 CrossrefISIGoogle Scholar6 S. N. Narahari Pandit, The shortest route problem—an addendum, Operations Res., 9 (1961), 129–132 CrossrefISIGoogle Scholar7 Alfonso Shimbel, Structure in communication nets, Proceedings of the symposium on information networks, New York, April, 1954, Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1955, 199–203 MR0076719 Google Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails Connectivity, Transitivity and Chromaticity: The Pioneering Work of Bernard Roy in Graph TheoryAiding Decisions with Multiple Criteria | 1 Jan 2002 Cross Ref An efficient VLSI algorithm for the all pairs shortest path problemJournal of Parallel and Distributed Computing, Vol. 16, No. 3 | 1 Nov 1992 Cross Ref Matrices and Linear AlgebraHandbook of Applied Mathematics | 1 Jan 1990 Cross Ref Shortest path algorithmsAnnals of Operations Research, Vol. 13, No. 1 | 1 Dec 1988 Cross Ref Large scale network analysis with applications to transportation, communication and inference networksDiscrete Mathematics, Vol. 72, No. 1-3 | 1 Dec 1988 Cross Ref Large Scale Network Analysis with Applications to Transportation, Communication and Inference NetworksGraph Theory and Applications, Proceedings of the First Japan Conference on Graph Theory and Applications | 1 Jan 1988 Cross Ref A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI ImplementationIEEE Transactions on Computers, Vol. C-35, No. 11 | 1 Nov 1986 Cross Ref Allowable processing orders in the accelerated cascade algorithmDiscrete Applied Mathematics, Vol. 13, No. 2-3 | 1 Mar 1986 Cross Ref Shortest path methods: A unifying approachNetflow at Pisa | 26 February 2009 Cross Ref Shortest-path methods: Complexity, interrelations and new propositionsNetworks, Vol. 14, No. 2 | 1 Jan 1984 Cross Ref Shortest-path algorithms: Taxonomy and annotationNetworks, Vol. 14, No. 2 | 1 Jan 1984 Cross Ref The cascade algorithmTen Applications of Graph Theory | 1 Jan 1984 Cross Ref Impossible pair constrained test path generation in a programInformation Sciences, Vol. 28, No. 2 | 1 Nov 1982 Cross Ref Parallel Algorithms for Network Routing Problems and RecurrencesJohn A. Wisniewski and Ahmed H. SamehSIAM Journal on Algebraic Discrete Methods, Vol. 3, No. 3 | 17 July 2006AbstractPDF (1372 KB)BibliographyGraphs and Questionnaires | 1 Jan 1980 Cross Ref A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, Vol. 9, No. 3 | 1 Jan 1979 Cross Ref Der KaskadealgorithmusAnwendungen der Graphentheorie | 1 Jan 1978 Cross Ref A survey of sparse matrix researchProceedings of the IEEE, Vol. 65, No. 4 | 1 Apr 1977 Cross Ref Algorithmus 31 Ein Algorithmus zur Bestimmung von Weganzahlen in NetzenComputing, Vol. 17, No. 1 | 1 Mar 1976 Cross Ref Structures algébriques généralisées des problèmes de cheminement dans les graphesRevue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle, Vol. 10, No. V2 | 29 March 2011 Cross Ref Plus court chemin avec contraintes : Algorithmes et applicationsAnnales Des Télécommunications, Vol. 30, No. 11-12 | 1 Nov 1975 Cross Ref Graphenalgorithmen und ÜberdeckungsproblemeComputing, Vol. 13, No. 2 | 1 Jun 1974 Cross Ref Anwendung von Graphenalgorithmen auf allgemeinere ProblemklassenComputing, Vol. 11, No. 3 | 1 Sep 1973 Cross Ref Multicommodity networks with resource constraints: The generalized multicommodity flow problemNetworks, Vol. 1, No. 3 | 1 Jan 1971 Cross Ref Minimization of Exclusive or and Logical Equivalence Switching CircuitsIEEE Transactions on Computers, Vol. C-19, No. 2 | 1 Feb 1970 Cross Ref A Modified Matrix Algorithm for Determining the Complete Connection Matrix of a Switching NetworkIEEE Transactions on Computers, Vol. C-19, No. 1 | 1 Jan 1970 Cross Ref An algorithm for finding shortest routes from all source nodes to a given destination in general networksQuarterly of Applied Mathematics, Vol. 27, No. 4 | 1 January 1970 Cross Ref An extension of the revised matrix algorithmIEEE International Symposium on Circuits and Systems Cross Ref Systolic mapping of inference network for the all-pair shortest path problemProceedings 1991 IEEE International Joint Conference on Neural Networks Cross Ref Recent Advances in Network FlowsSIAM Review, Vol. 10, No. 3 | 18 July 2006AbstractPDF (775 KB) Volume 15, Issue 1| 1967SIAM Journal on Applied Mathematics1-230 History Submitted:22 September 1965Accepted:18 August 1966Published online:13 July 2006 InformationCopyright © 1967 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0115017Article page range:pp. 207-218ISSN (print):0036-1399ISSN (online):1095-712XPublisher:Society for Industrial and Applied Mathematics