712 search results - page 18 / 143 » On Spectral Graph Drawing |
GD
1998
Springer
13 years 11 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...
GLVLSI
2002
IEEE
14 years 13 days ago
2002
IEEE
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
JGAA
2007
13 years 7 months ago
2007
Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principl...
SOFSEM
2005
Springer
14 years 29 days 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
13 years 12 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...