By Topic

Generalized optimum path search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
A. Y. Tetelbaum ; Dept. of Electr. Eng., Michigan State Univ., East Lansing, MI, USA

The author gives a classification of the monotone path functions of a graph. It is shown that one possibility of performing an optimum path search for a generalized path function is to reduce the problem to a shortest path search through the state space. A general algorithm for the optimum path search is proposed and discussed. The proposed algorithm can be considered as a general method of performing a search in the state space for three classes of problems. Modifications of the algorithm for each of the three types of path functions are described. Under some conditions, behavior of the algorithm is close to linear. Finally, an analysis of the implementation of this algorithm for identifying an optimum path in the state space is given

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:14 ,  Issue: 12 )