514 search results - page 67 / 103 » Drawing a Graph in a Hypercube |
IPL
2007
14 years 9 months ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
114
click to vote
ISCA
2012
IEEE
13 years 3 days ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
INFOVIS
1997
IEEE
15 years 1 months ago
1997
IEEE
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
108
click to vote
VL
2009
IEEE
15 years 4 months ago
2009
IEEE
Euler diagrams form the basis of several visual modelling notations, including statecharts and constraint diagrams. Recently, various techniques for automated Euler diagram drawin...
IV
2009
IEEE
15 years 4 months ago
2009
IEEE
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...