Title :
Optimal algorithms for restricted single row routing problems
Author :
Hossain, Moazzem ; Sherwani, Naveed A. ; Deogun, Jitender
Author_Institution :
Dept. of Comput. Sci., Western Michigan Univ., Kalamazoo, MI, USA
Abstract :
Some restricted single-row routing problem are considered. A graph-theoretic approach is used to obtain restricted classes of single-row routing problems. Optimal street congestion algorithms are proposed for single-row routing problems that have overlap graphs isomorphic to path, binary tree, and clique
Keywords :
circuit layout; graph theory; network routing; binary tree; clique; graph-theoretic approach; optimal algorithms; overlap graphs; restricted classes; single row routing problems; street congestion algorithms; Algorithm design and analysis; Binary trees; Computer science; Heuristic algorithms; Routing;
Conference_Titel :
Circuits and Systems, 1991., Proceedings of the 34th Midwest Symposium on
Conference_Location :
Monterey, CA
Print_ISBN :
0-7803-0620-1
DOI :
10.1109/MWSCAS.1991.252086
