Bennett L. Fox
Abstract
Open-access reader
In a recent paper [4], Minieka proposes an algorithm for finding k th shortest paths between all pairs of nodes in an N node network. His claimed time is O ( k 2 N 3 ).
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In a recent paper [4], Minieka proposes an algorithm for finding k th shortest paths between all pairs of nodes in an N node network. His claimed time is O ( k 2 N 3 ).
Key concepts: Shortest path problem, Node (physics), Computer science, K shortest path routing, Combinatorics, Floyd–Warshall algorithm, Shortest Path Faster Algorithm, Algorithm