Sliceable Floorplanning by Graph Dualization
作者： Gary K. H. Yeap , Majid Sarrafzadeh
DOI: 10.1137/S0895480191266700
关键词:
摘要: Previous algorithms on rectangular dual graph floorplanning generate general floorplans which include the class of nonsliceable floorplans. We examine framework generating sliceable using approach and present an algorithm that generates a floorplan if input satisfies certain sufficient conditions. For input, is still able to by introducing pseudomodules where areas occupied are used for wiring. $n$-vertex adjacency graph, in $O(n \log n + hn)$ time $h$ height tree.
sci-hub.se 参考文章(0)