Sciweavers

515 search results - page 31 / 103
» Layouts of Expander Graphs
Sort
View
ASPDAC
2005
ACM
111views Hardware» more  ASPDAC 2005»
13 years 11 months ago
Placement with symmetry constraints for analog layout design using TCG-S
In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module...
Jai-Ming Lin, Guang-Ming Wu, Yao-Wen Chang, Jen-Hu...
TCAD
2010
194views more  TCAD 2010»
13 years 4 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...
GD
2000
Springer
14 years 1 months ago
A Fast Multi-scale Method for Drawing Large Graphs
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
David Harel, Yehuda Koren
VLDB
2005
ACM
144views Database» more  VLDB 2005»
14 years 3 months ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...
COCOON
2006
Springer
14 years 1 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng