SSDE:: Fast graph drawing using sampled spectral distance embedding
Yazarlar (3)
Prof. Dr. Ali ÇİVRİL Rensselaer Polytechnic Institute, Amerika Birleşik Devletleri
Malik Magdon-Ismail Rensselaer Polytechnic Institute, Amerika Birleşik Devletleri
Eli Bocek-Rivele Rensselaer Polytechnic Institute, Amerika Birleşik Devletleri
| Bildiri Türü |
Tebliğ/Bildiri
|
Bildiri Dili | İngilizce |
| Bildiri Alt Türü | Tam Metin Olarak Yayınlanan Tebliğ (Uluslararası Kongre/Sempozyum) | ||
| Bildiri Niteliği | Web of Science Kapsamındaki Kongre/Sempozyum | ||
| DOI Numarası | 10.1007/978-3-540-70904-6_5 | ||
| Kongre Adı | |||
| Kongre Tarihi | / | ||
| Basıldığı Ülke | Basıldığı Şehir | ||
| Bildiri Linki | https://link.springer.com/content/pdf/10.1007%2F978-3-540-70904-6_5.pdf | ||
| UAK Araştırma Alanları |
Mühendislik
|
||
| Özet |
| We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratic-time spectral algorithm, which approximates the real distances of the nodes in the final drawing with their graph theoretical distances. We build from this idea to develop the linear-time spectral graph drawing algorithm SSDE. We reduce the space and time complexity of the spectral decomposition by approximating the distance matrix with the product of three smaller matrices, which are formed by sampling rows and columns of the distance matrix. The main advantages of our algorithm are that it is very fast and it gives aesthetically pleasing results, when compared to other spectral graph drawing algorithms. The runtime for typical 105 node graphs is about one second and for 106 node graphs about ten seconds. |
| Anahtar Kelimeler |
BM Sürdürülebilir Kalkınma Amaçları
| Atıf Sayıları | |
| Web of Science | 9 |
| Scopus | 11 |
| Google Scholar | 33 |