Allowable processing orders in the accelerated cascade algorithm

DOI10.1016/0166-218X(86)90083-1zbMath0587.90095MaRDI QIDQ1072941

A. J. Goldman, Prasoon Tiwari

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

accelerated versionall shortest distances cascade algorithmprocessing-order for distance-matrix entries

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05)

Related Items (1)

Allowable processing orders in the accelerated cascade algorithm

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Allowable processing orders in the accelerated cascade algorithm
• Algebraic structures for transitive closure
• Iterative methods for determining the k shortest paths in a network
• NP-Complete operations research problems and approximation algorithms
• Revised Matrix Algorithms for Shortest Paths
• The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: Allowable processing orders in the accelerated cascade algorithm