Journal ArticleDOI
Optimal routing through dense channels
TLDR
A new channel routing algorithm in the knock-knee mode that produces for dense problems area-optimal layouts with minimum total wire length and bends, where the total number of bends is at most d−2 (d density) more than the minimum.Abstract:
We present a new channel routing algorithm in the knock-knee mode that produces for dense problems area-optimal layouts with minimum total wire length and bends (n number of nets), where the total number of bends is at most d−2 (d density) more than the minimum. The running time is . It thus improves the algorithm in Formann et al.,3 which determines area-optimal layouts with minimum total wire length in time, where the number of bends is Ω(n2). Moreover, the algorithm can be modified so as to guarantee three-layer wirable layouts, where the total wire length is at most n−2 more than the minimum. The approach we use is completely different from all previously known algorithms. It is based on the notion of cycle graphs introduced in this paper.read more
Citations
More filters
Journal ArticleDOI
Finiteness Theorems for Graphs and Posets Obtained by Compositions
TL;DR: In this article, the authors investigate classes of graphs and posets that admit decompositions to obtain or disprove finiteness results for obstruction sets and develop a theory of minimal infinite antichains.
Edge-Disjoint Paths in Planar Graphs with Short Total Length
TL;DR: The problem of nding edge{disjoint paths of minimum total length in a planar graph such that each path connects two speciied vertices on the outer face of the graph is proved to be N P{hard, even if the graph fullllls the Eulerian condition and the maximum degree is four.
Book ChapterDOI
Chapter 8 VLSI network design
TL;DR: This chapter deals with special layout technologies that usually occur in logic synthesis, i.e. in the construction of the physical components that are given for the layout and routing phases, and reveals some rich and surprising connections to independent and currently very active areas of graph theory.
Journal ArticleDOI
Wiring knock-knee layouts: a global approach
TL;DR: The authors show that for a large class of layouts a three-layer wiring can be constructed by solving a path problem in a special class of graphs or a two-satisfiability problem, and thus may be wired in time linear in the size of the layout area.
Journal ArticleDOI
PlaNet: A software package of algorithms and heuristics for disjoint paths in planar networks
TL;DR: It is proved that the problem of finding edge-disjoint paths of minimum total length in a planar graph is NP -hard, even if all terminals lie on the outer face, the Eulerian condition is fulfilled, and the maximum degree is four.