ScholarLens Back to search
1965•Unpublished venueRequires access

MULTI-TERMINAL SHORTEST PATHS

T. C. Hu

Open publisher page 0 citations

Abstract

Abstract : The present paper gives an algorithm that finds simultaneously the shortest paths between many pairs of nodes in a given network. In the book by Berge, the values of shortest paths between many pairs of nodes are found. Here, use is made of a special matrix multiplication technique to find the actual arcs that are used to form the shortest paths. In a network with n nodes, log sub 2 (n-1) special matrix multiplications are needed to find all the shortest paths. The present paper also gives an algorithm for constructing a network with prescribed shortest distances and with the total distances associated with arcs a minimum.

About this research paper

What this paper is about

Abstract : The present paper gives an algorithm that finds simultaneously the shortest paths between many pairs of nodes in a given network. In the book by Berge, the values of shortest paths between many pairs of nodes are found. Here, use is made of a special matrix multiplication technique to find the actual arcs that are used to form the shortest paths. In a network with n nodes, log sub 2 (n-1) special matrix multiplications are needed to find all the shortest paths. The present paper also gives an algorithm for constructing a network with prescribed shortest distances and with the total distances associated with arcs a minimum.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract : The present paper gives an algorithm that finds simultaneously the shortest paths between many pairs of nodes in a given network. In the book by Berge, the values of shortest paths between many pairs of nodes are found. Here, use is made of a special matrix multiplication technique to find the actual arcs that are used to form the shortest paths. In a network with n nodes, log sub 2 (n-1) special matrix multiplications are needed to find all the shortest paths. The present paper also gives an algorithm for constructing a network with prescribed shortest distances and with the total distances associated with arcs a minimum.

Key concepts: Terminal (telecommunication), Computer science, Computer network

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
MULTI-TERMINAL SHORTEST PATHS — Research Paper | ScholarLens