# A graph theoretic approach to minimize total wire length in channel routing

##### Citations

6 citations

### Cites background from "A graph theoretic approach to minim..."

...cost optimization criterion in routing a channel [4], [12], [14], [19], [20] followed by wire length minimization [10], [16], [18]....

[...]

1 citations

### Cites background or methods from "A graph theoretic approach to minim..."

...for wire length minimization [8], and algorithm Modified_Track_Assignment_Heuristic (MTAH) for wire length minimization [11]....

[...]

...have been developed for computing area and/or wire length minimization in two-layer no-dogleg Manhattan channel routing model [8,9,11]....

[...]

...Generally, a channel is a rectangular routing region between circuit blocks having two parallel rows of fixed terminals on a chip floor [1-3,5-14]....

[...]

...In literature, only a very few algorithm have been devised for minimizing total wire length of the channel [2,3,8,9,11,12]....

[...]

1 citations

### Cites background or methods from "A graph theoretic approach to minim..."

...Most of the algorithms have been developed for area minimization of a channel [1-2,5-6,9-10,14] and only a few have been concentrated on wire length minimization [3,8-12]....

[...]

...As already mentioned that most of the channel routing algorithms in literature have been developed for area minimization and only a very few have been devised for minimizing total wire length of the channel [1-3,5-14]....

[...]

1 citations

### Cites background from "A graph theoretic approach to minim..."

...Keywords: Dogleg Channel Routing, VLSI Physical Design Automation, Constraint Programming...

[...]

### Cites methods from "A graph theoretic approach to minim..."

...As a consequence, several two-layer heuristic algorithms for computing minimum area channel routing solutions have been proposed in last three decades [1,2,6,10] (and many others), and a very few work in minimizing wire length has been done in the RLMR model [4,7,8,9]....

[...]

##### References

655 citations

539 citations

### "A graph theoretic approach to minim..." refers background in this paper

...One of the most important routing strategies is channel routing [6, 8 ]....

[...]

...As a consequence, several two-layer channel routing heuristic algorithms for computing minimum area routing solutions have been proposed in last three decades [2,3, 8 ], and a very few work in minimizing wire length has been done in the reserved layer Manhattan routing model [6]....

[...]

...the horizontal constraint graph (HCG) and the vertical constraint graph (VCG) [6, 8 ]....

[...]

53 citations

33 citations

20 citations