AN EFFICIENT ALGORITHM FOR WIDTHS OF CHANNEL ROUTING WITH GIVEN HORIZONTAL CONSTRAINT GRAPH

Authors

  • Xianya Geng Anhui University of Science and Technology - Department of Mathematics and Physics
  • Xianwen Fang Anhui University of Science and Technology - Department of Mathematics and Physics
  • Dequan Li Anhui University of Science and Technology - Department of Mathematics and Physics
  • Jing Chu Anhui University of Science and Technology - Department of Mathematics and Physics

Keywords:

channel routing, Manhattan model, VLSI

Abstract

In VLSI design, one of the most important detailed routings is the channel routing.  Channel routing in the 2-layer Manhattan model is one of the most investigated problem in VLSI design.  In this paper, we consider the channel with horizontal constraint graph is a star.  An efficient graph theoretic algorithm is presented, compared with the latest results, our algorithm yields a better bound on the width of the
channel.

Cover of n°35 Italian Journal of Pure and Applied Mathematics

Downloads

Published

2015-12-31

How to Cite

Geng, X., Fang, X., Li, D., & Chu, J. (2015). AN EFFICIENT ALGORITHM FOR WIDTHS OF CHANNEL ROUTING WITH GIVEN HORIZONTAL CONSTRAINT GRAPH. Italian Journal of Pure and Applied Mathematics, 35, 305–310. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/6431

Issue

N°35 - December 2015

Section

Articoli - Forum Editrice

License

Copyright (c) 2015 Xianya Geng, Xianwen Fang, Dequan Li, Jing Chu

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

L'opera è pubblicata sotto  Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)

Similar Articles

<< < 1 2 

You may also start an advanced similarity search for this article.