Drawing Big Graphs Using Spectral Sparsification

DOI10.1007/978-3-319-73915-1_22zbMath1503.68218arXiv1708.08659OpenAlexW2964077811MaRDI QIDQ4625115

No author found.

Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.08659

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The relative neighbourhood graph of a finite planar set
• Generalized inverses. Theory and applications.
• The university of Florida sparse matrix collection
• Spectral Sparsification of Graphs
• Handbook of Graph Theory
• Graph Drawing
• Shape-Based Quality Metrics for Large Graph Visualization

This page was built for publication: Drawing Big Graphs Using Spectral Sparsification