Spectral graph drawing: Building blocks and performance analysis

Shad Kirmani, Kamesh Madduri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings - 2018 IEEE 32nd International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages269-277
Number of pages9
ISBN (Print)9781538655559
DOIs
StatePublished - Aug 3 2018
Event32nd IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2018 - Vancouver, Canada
Duration: May 21 2018May 25 2018

Publication series

NameProceedings - 2018 IEEE 32nd International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2018

Other

Other32nd IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2018
CountryCanada
CityVancouver
Period5/21/185/25/18

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Spectral graph drawing: Building blocks and performance analysis'. Together they form a unique fingerprint.

Cite this