515 search results - page 14 / 103 » Layouts of Expander Graphs |
TOG
2008
13 years 9 months ago
2008
We present an interactive system for synthesizing urban layouts by example. Our method simultaneously performs both a structurebased synthesis and an image-based synthesis to gene...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...
GD
2004
Springer
14 years 3 months 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...
SOFTVIS
2006
ACM
14 years 3 months ago
2006
ACM
It is vital for any developer to keep track of changes during his project. Thus, it is common practice to take static snapshots of single class diagrams. But to preserve the menta...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
It is known that the expansion property of a graph influences the performance of the corresponding code when decoded using iterative algorithms. Certain graph products may be used ...