Constraint graph (layout)

Known as: Horizontal constraint graph, Vertical constraint graph 
In some tasks of integrated circuit layout design a necessity arises to optimize placement of non-overlapping objects in the plane. In general this… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2010
01219852010

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Crosstalk appears in various electrical circuits and chip design. This is due to stretches of overlapping wires that produce… (More)
Is this relevant?
2008
2008
In this paper a technique has been introduced for reducing crosstalk for restricted channel routing. First, the random channel… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 4
Is this relevant?
1994
1994
We present a new efficient algorithm for both two and threelayer over-the-cell channel routing in the standard cell design… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
1993
1993
In this paper, we present a new algorithm called WISER for over-the-cell channel routing in the standard cell design style using… (More)
  • figure 1
  • table I
  • figure 3
  • table 11
  • figure 4
Is this relevant?
1993
1993
The paper demonstrates that the vertical constraint graph (VCG) is not a complete representation of the vertical constraints of a… (More)
Is this relevant?
1991
1991
In this paper, we present a new algorithm, called WISER, for over-the-cell channel routing in the standard cell design technology… (More)
  • figure 1
  • figure 2
  • figure 3
  • table II
  • figure 4
Is this relevant?
1988
1988
Two subproblems that arise when routing channels with interchangeable terminals are shown to be NP-hard. These problems are: P1… (More)
  • figure 3
  • figure 1
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
1988
1988
LGORITHMS to route channels with fixed terminals A have been proposed by several authors. [1]-[4] propose algorithms for this… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 12
  • figure 13
Is this relevant?
1987
1987
We present a hybrid three-layer channel-routing algorithm that combines horizontal-vertical-horizontal (HVH) and vertical… (More)
Is this relevant?
1985
1985
The channel router, which routes a rectangular channel with two rows of terminals along its top and bottom sides, is extensively… (More)
Is this relevant?