514 search results - page 20 / 103 » Drawing a Graph in a Hypercube |
GD
2004
Springer
14 years 4 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
GD
1998
Springer
14 years 3 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
IPL
2008
13 years 10 months ago
2008
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
SOFSEM
2005
Springer
14 years 4 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
GD
2001
Springer
14 years 3 months ago
2001
Springer
The origins of chart graphics (e.g., bar charts and line charts) are well known, with the seminal event being the publication of William Playfair´s (1759-1823) ¨The Commercial a...