作者: A. Pitak , C. Lursinsap
关键词:
摘要: A graph-theoretic algorithm is presented for the layer assignment and via minimization of a gridless switchbox routing. concept called propagation used to facilitate vias. The time complexity proposed O( n log + K ), where number routing wire segments in layout maximum vias that can occur. approach achieves minimum several difficult problems