@inproceedings{03d495c36cfa4771bdf13dc5f28220e7,
title = "Spectral graph drawing: Building blocks and performance analysis",
abstract = "The objective of a graph drawing algorithm is to automatically produce an aesthetically-pleasing two or three dimensional visualization of a graph. Spectral graph theory refers to the study of eigenvectors of matrices derived from graphs. There are several well-known graph drawing algorithms that use insights from spectral graph theory. In this work, we experiment with two spectral methods to generate drawings of large-scale graphs. We also combine spectral drawings with the multilevel approach, and this leads to a larger collection of implementations. We analyze drawing quality and performance tradeoffs with these approaches.",
author = "Shad Kirmani and Kamesh Madduri",
note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 32nd IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2018 ; Conference date: 21-05-2018 Through 25-05-2018",
year = "2018",
month = aug,
day = "3",
doi = "10.1109/IPDPSW.2018.00053",
language = "English (US)",
isbn = "9781538655559",
series = "Proceedings - 2018 IEEE 32nd International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "269--277",
booktitle = "Proceedings - 2018 IEEE 32nd International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2018",
address = "United States",
}