Generalized optimum path search

Author

Tetelbaum, Alexander Y.

Author_Institution

Dept. of Electr. Eng., Michigan State Univ., East Lansing, MI, USA

Volume

14

Issue

12

fYear

1995

fDate

12/1/1995 12:00:00 AM

Firstpage

1586

Lastpage

1590

Abstract

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

Keywords

circuit layout CAD; circuit optimisation; graph theory; integrated circuit layout; network routing; search problems; general algorithm; graph; monotone path functions; optimum path search; shortest path search; state space; Circuit faults; Circuit testing; Combinational circuits; Delay; Design automation; Fault tolerance; Logic testing; Robustness; Sequential analysis; State-space methods;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/43.476588

Filename

476588