17 citations · 45 across the 15 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.CG2017
Drawing Big Graphs using Spectral Sparsification
Peter Eades, Quan Nguyen, Seok-Hee Hong
Spectral sparsification is a general technique developed by Spielman et al. to reduce the number of edges in a graph while retaining its structural properties. We investigate the u…
cs.CG2017
Gap-planar Graphs
Sang Won Bae, Jean-Francois Baffier, Jinhee Chun +8
We introduce the family of -gap-planar graphs for , i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge…
cs.CG2017★ 4 cited
Towards Faithful Graph Visualizations
Quan Hoang Nguyen, Peter Eades
Readability criteria have been addressed as a measurement of the quality of graph visualizations. In this paper, we argue that readability criteria are necessary but not sufficient…