Abstract
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 ).

This publication has 5 references indexed in Scilit: