HVH. . .VH multi-layer channel routing

The authors present an algorithm for the HVH. . .VH multi-layer channel routing problem. First they determine the net groups to be positioned on the same track using a left-edge algorithm. The vertical constraint graph made from these net groups may contain many cycles. There is an attempt to remove the cycles through proper layer assignment and maze routing.<
>