发明名称 ROUTING METHOD REMOVING CYCLES IN VERTICAL CONSTRAINT GRAPH
摘要 <p>In an improved routing method first a vertical constraint graph is generated in which a critical node is selected. The critical node is expanded to contain a subnode or its corresponding terminals. The resulting subnodes within the critical node are interconnected by edge that are representative of vertical constraints. A graph coloring method is employed to split the critical node into a number of new nodes. Thereby it is possible to route channels having multi-dimensional vertical constraints.</p>
申请公布号 WO1998033132(A1) 申请公布日期 1998.07.30
申请号 RU1997000007 申请日期 1997.01.23
申请人 发明人
分类号 主分类号
代理机构 代理人
主权项
地址