Revised Matrix Algorithms for Shortest Paths

DOI10.1137/0115017zbMATH Open0158.15404OpenAlexW1989575783MaRDI QIDQ5540862FDOQ5540862

Authors:

Publication date: 1967

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0115017

zbMATH Keywords

numerical analysis

Cited In (8)

• Parallel Algorithms for Network Routing Problems and Recurrences
• Anwendung von Graphenalgorithmen auf allgemeinere Problemklassen
• An algorithm of optimization for a special class of networks
• Ein Algorithmus zur Bestimmung von Weganzahlen in Netzen
• Impossible pair constrained test path generation in a program
• Allowable processing orders in the accelerated cascade algorithm
• Matching, Euler tours and the Chinese postman
• Large-scale network analysis with applications to transportation, communication and inference networks

This page was built for publication: Revised Matrix Algorithms for Shortest Paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5540862)