DocumentCode
1193569
Title
A note on the shortest path through a given link in a network
Author
Lau, H.T.
Volume
33
Issue
1
fYear
1986
fDate
1/1/1986 12:00:00 AM
Firstpage
109
Lastpage
110
Abstract
A network, or a graph, can be described by a set of nodes or vertices and a set of links or edges. Let 
be two vertices and 
be a link in a given undirected network. We show that a shortest path between 
and 
through can be found by transforming the problem into a minimum cost network flow problem. It may be noted that when the network is directed, the problem is 
-complete.
be two vertices and be a link in a given undirected network. We show that a shortest path between and through can be found by transforming the problem into a minimum cost network flow problem. It may be noted that when the network is directed, the problem is -complete.Keywords
Graph theory; Circuits and systems; Cutoff frequency; Digital filters; Finite impulse response filter; Frequency locked loops; Low pass filters; Prototypes; Signal processing; Speech processing; Transforms;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/TCS.1986.1085822
Filename
1085822
Link To Document