488 search results - page 39 / 98 » Automorphic Decompositions of Graphs |
182
click to vote
TCAD
2010
14 years 10 months ago
2010
Abstract--In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different ex...
103
click to vote
ISHPC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. The class of dense circulant graphs of degree four with optimal distance-related properties is analyzed in this paper. An algebraic study of this class is done. Two geome...
120
click to vote
GD
2005
Springer
15 years 8 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
154
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
111
click to vote
WG
2001
Springer
15 years 7 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...