Sciweavers

514 search results - page 1 / 103
» Drawing a Graph in a Hypercube
Sort
View
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
13 years 4 months ago
Drawing a Graph in a Hypercube
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...
David R. Wood
IAJIT
2011
12 years 8 months ago
On the genus of pancake network
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...
Quan T. Nguyen, Saïd Bettayeb
GD
2004
Springer
13 years 9 months ago
Layout Volumes of the Hypercube
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...
Lubomir Torok, Imrich Vrto
IV
2005
IEEE
81views Visualization» more  IV 2005»
13 years 10 months ago
A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
Chun-Cheng Lin, Hsu-Chun Yen
ENDM
2007
100views more  ENDM 2007»
13 years 4 months ago
Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
Sanming Zhou