34 search results - page 4 / 7 » Layout of Graphs with Bounded Tree-Width |
GD
2004
Springer
14 years 22 days ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
WG
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
GD
2004
Springer
14 years 22 days ago
2004
Springer
We study 3-dimensional layouts of the hypercube in a 1-active layer and general model. The problem can be understood as a graph drawing problem in 3D space and was addressed at Gr...
DAC
2005
ACM
13 years 9 months ago
2005
ACM
Layout parasitics have great impact on analog circuit performance. This paper presents an algorithm for explicit parasitic control during layout retargeting of analog integrated c...