Hairball Buster: A Graph Triage Method for Viewing and Comparing Graphs
Patrick Allen/ Mark Matties/ Elisha Peterson
Abstract Hairball buster (HB) (also called node-neighbor centrality or NNC) is an approach to graph analytic triage that uses simple calculations and visualization to quickly understand and compare graphs. Rather than displaying highly interconnected graphs as ‘hairballs’ that are difficult to understand, HB provides a simple standard visual representation of a graph and its metrics, combining a monotonically decreasing curve of node metrics with indicators of each node’s neighbors’ metrics. The(..)
DOI: 10.21307/connections-2019.009