712 search results - page 10 / 143 » On Spectral Graph Drawing |
GD
2001
Springer
13 years 12 months ago
2001
Springer
Following a workshop on graph data formats held with the 8th Symposium on Graph Drawing (GD 2000), a task group was formed to propose a format for graphs and graph drawings that me...
SMI
2003
IEEE
14 years 22 days ago
2003
IEEE
Partitioning is a fundamental operation on graphs. In this paper we briefly review the basic concepts of graph partitioning and its relationship to digital mesh processing. We als...
JGAA
2000
13 years 7 months ago
2000
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
GD
2005
Springer
14 years 1 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...