4 citations · 7 across the 4 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2018★ 3 cited
INKA: An Ink-based Model of Graph Visualization
Quan Hoang Nguyen
Common quality metrics of graph drawing have been about the readability criteria, such as small number of edge crossings, small drawing area and small total edge length. Bold graph…
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★ 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…