DocumentCode
3140151
Title
A new graph theoretical approach to the selection of rip-ups
Author
Bartholomeus, Marc ; Raith, Manuela
Author_Institution
Siemens AG, Munich, Germany
fYear
1991
fDate
27-31 May 1991
Firstpage
224
Lastpage
229
Abstract
Presents a new approach to the selection of rip-ups to be used in a rip-up and reroute router. This technique is based on a hypergraph model. The novelty of the authors´ approach is that given a blocking situation, a minimal set of connections to be ripped-up is simultaneously calculated and removed. The selection of the best ripping set is based on its reroutability potential.<>
Keywords
VLSI; circuit layout CAD; network routing; printed circuit design; automated routing; blocking situation; graph theoretical approach; hypergraph model; minimal rip-up set; reroutability potential; rip-up and reroute router; selection of rip-ups; Cost function; Humans; Integrated circuit interconnections; Integrated circuit technology; Printed circuits; Process design; Reflection; Routing; Very large scale integration; Wiring;
fLanguage
English
Publisher
ieee
Conference_Titel
Euro ASIC '91
Conference_Location
Paris, France
Print_ISBN
0-8186-2185-0
Type
conf
DOI
10.1109/EUASIC.1991.212863
Filename
212863
Link To Document