• Corpus ID: 3357923

Graph Theory Based Routing Algorithms

  title={Graph Theory Based Routing Algorithms},
  author={Bo Wu},
  • Bo Wu
  • Published 2017
  • Computer Science


  • A. Sherwani and M. Sarrafzadeh, “New Algorithm for Over-the-Cell Channel Routing Using Vacant Terminals,” Proceeding of 28th AC M /IEEE Design Automation Conference, pp.126-131
  • 1991
  • Roy and N. A. Sherwani, “Single Row Routing with Bounded Number of Doglegs Per Net,” Proceedings of 1989 IEEE International Sym­ posium on Circuits and Systems, pp.43-46, May 9-11
  • 1989
and Y
  • L. Lin, “Channel Density Re­ duction by Routing Over the Cells,” Proceedings o f 28th ACM /IEEE Design Automation Conference, pp.120-125
  • 1991
Combinatorial algorithms for integrated circuit layout
This paper will concern you to try reading combinatorial algorithms for integrated circuit layout as one of the reading material to finish quickly.
Maximum Weighted /^-Coverings in Transi­ tive Graphs,
  • Proceedings o f 1990 IEEE Symposium on Circuits and Systems,
  • 1990
Over-the-cell channel routing
  • J. Cong, C. Liu
  • Business, Computer Science
    IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 1990
An over-the-cell channel router that produces solutions which are better than the optimal two-layer channel routing solutions for all test examples is designed and outperforms the over- the- cell channel router described by Y. Shiraishi and Y. Sakemi.
A new approach to topological via minimization
A two-chain maximum dominance problem, which is of interest in its own right, is considered, and its applications to other very large-scale integration layout problems are shown.
Via Assignment in Single-Row Routing
Experimental results establish the superiority of the new heuristics over earlier ones that are obtained in the via assignment problem that arises when the single-row routing approach to the interconnection problem is used.
and C
  • K. Wong, “A Global Router Based on Steiner Min-Max Trees,” ICCAD-89, pp.2-5
  • 1989
A graph theoretic approach to single row routing problems
A novel approach to the classical single-row routing problem, based on a graph-theoretic representation, in which an instance of the single row routing problem is represented by three graphs: a circle graph, a permutation graph, and an interval graph.