Title :
An electrical method for finding suboptimal routes
Author :
Jin, Lin-Ming ; Chan, Shu-Park
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Santa Clara Univ., CA, USA
Abstract :
An algorithm is presented for finding the suboptimal routes, or the kth shortest paths, between two nodes in a network. The algorithm works by building up an electric computational analogy that consists of an ideal diode in series with a DC voltage source. The computational operations increase linearly with the order of k. The algorithm also works efficiently for finding all routes between two nodes for a given network
Keywords :
VLSI; circuit layout CAD; computational complexity; graph theory; DC voltage source; efficient all routes finding algorithm; electric computational analogy; electrical method; electrical suboptimal route finding method; ideal diode; k order; kth shortest paths; linear computational operation increase; network node; suboptimal route finding algorithm; suboptimal routes; Circuits; Cities and towns; Costs; Diodes; Iterative algorithms; Laboratories; Partitioning algorithms; Voltage;
Conference_Titel :
Circuits and Systems, 1989., IEEE International Symposium on
Conference_Location :
Portland, OR
DOI :
10.1109/ISCAS.1989.100505
