We present a novel graph drawing algorithm which uses a spectral decomposition of the distance matrix to approximate the graph theoretical distances. The algorithm preserves symmetry and node densities, i.e., the drawings are aesthetically pleasing. The runtime for typical 20,000 node graphs ranges from 100 to 150 seconds
The distance preserving graph embedding problem is to embed the vertices of a given weighted graph o...
We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases...
Graph partitioning problems are a central topic of research in the study of approximation algorithms...
We present a novel graph drawing algorithm which uses a spectral decomposition of the distance matri...
Abstract. We present a novel algorithm for drawing undirected connected graphs, by using a spectral ...
We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Multi-Di...
Abstract. With shortest-path distances as input, classical multidimen-sional scaling can be regarded...
With shortest-path distances as input, classical multidimensional scaling can be regarded as a spect...
Abstract. With shortest-path distances as input, classical multidimen-sional scaling can be regarded...
In numerous application areas, general undirected graphs need to be drawn, and force-directed layout...
We give an overview of graph drawing techniques as discussed by Godsil/Royle, Koren and Pisanski/Sha...
AbstractThe spectral approach for graph visualization computes the layout of a graph using certain e...
Thesis: Ph. D. in Computer Science, Massachusetts Institute of Technology, Department of Electrical ...
We use eigenvectors of several graph related matrices to draw graphs. Layout properties and implemen...
This thesis presents a new graph drawing approach (the concentric approach) for drawing any undirect...
The distance preserving graph embedding problem is to embed the vertices of a given weighted graph o...
We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases...
Graph partitioning problems are a central topic of research in the study of approximation algorithms...
We present a novel graph drawing algorithm which uses a spectral decomposition of the distance matri...
Abstract. We present a novel algorithm for drawing undirected connected graphs, by using a spectral ...
We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Multi-Di...
Abstract. With shortest-path distances as input, classical multidimen-sional scaling can be regarded...
With shortest-path distances as input, classical multidimensional scaling can be regarded as a spect...
Abstract. With shortest-path distances as input, classical multidimen-sional scaling can be regarded...
In numerous application areas, general undirected graphs need to be drawn, and force-directed layout...
We give an overview of graph drawing techniques as discussed by Godsil/Royle, Koren and Pisanski/Sha...
AbstractThe spectral approach for graph visualization computes the layout of a graph using certain e...
Thesis: Ph. D. in Computer Science, Massachusetts Institute of Technology, Department of Electrical ...
We use eigenvectors of several graph related matrices to draw graphs. Layout properties and implemen...
This thesis presents a new graph drawing approach (the concentric approach) for drawing any undirect...
The distance preserving graph embedding problem is to embed the vertices of a given weighted graph o...
We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases...
Graph partitioning problems are a central topic of research in the study of approximation algorithms...
DOI
Add to ORKG