Sciweavers

147 search results - page 13 / 30
» Cycle decompositions of the complete graph
Sort
View
JDA
2010
131views more  JDA 2010»
13 years 6 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi
NETWORKS
2007
13 years 7 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
TCAD
2010
194views more  TCAD 2010»
13 years 2 months ago
Layout Decomposition Approaches for Double Patterning Lithography
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...
Andrew B. Kahng, Chul-Hong Park, Xu Xu, Hailong Ya...
CJCDGCGT
2005
Springer
13 years 10 months ago
Fractional Vertex Arboricity of Graphs
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
Qinglin Yu, Lian-Cui Zuo
ITCC
2003
IEEE
14 years 1 months ago
Distance-Hereditary Embeddings of Circulant Graphs
In this paper we present a distance-hereditary decomposition of optimal chordal rings of 2k2 nodes into a set of rings of 2k nodes, where k is the diameter. All the rings belongin...
Carmen Martínez, Ramón Beivide, Jaim...