26 citations · 54 across the 13 of their papers we have counts for
7 papers · 1 filter
Shape-Faithful Graph Drawings
Amyra Meidiana, Seok-Hee Hong, Peter Eades
Shape-based metrics measure how faithfully a drawing D represents the structure of a graph G, using the proximity graph S of D. While some limited graph classes admit proximity dra…
New Quality Metrics for Dynamic Graph Drawing
Amyra Meidiana, Seok-Hee Hong, Peter Eades
In this paper, we present new quality metrics for dynamic graph drawings. Namely, we present a new framework for change faithfulness metrics for dynamic graph drawings, which compa…
A Quality Metric for Symmetric Graph Drawings
Amyra Meidiana, Seok-Hee Hong, Peter Eades +1
Symmetry is an important aesthetic criteria in graph drawing and network visualisation. Symmetric graph drawings aim to faithfully represent automorphisms of graphs as geometric sy…
Multi-level Graph Drawing using Infomap Clustering
Seok-Hee Hong, Peter Eades, Marnijati Torkel +5
Infomap clustering finds the community structures that minimize the expected description length of a random walk trajectory; algorithms for infomap clustering run fast in practice…
A Quality Metric for Visualization of Clusters in Graphs
Amyra Meidiana, Seok-Hee Hong, Peter Eades +1
Traditionally, graph quality metrics focus on readability, but recent studies show the need for metrics which are more specific to the discovery of patterns in graphs. Cluster anal…
Turning Cliques into Paths to Achieve Planarity
Patrizio Angelini, Peter Eades, Seok-Hee Hong +5
Motivated by hybrid graph representations, we introduce and study the following beyond-planarity problem, which we call -Clique2Path Planarity: Given a graph , whose vertices…