id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_5q357hhw75ff3ebwvg7x5x4ssu	Patrick Allen	Hairball Buster: A Graph Triage Method for Viewing and Comparing Graphs	2020	24	.pdf	application/pdf	11602	2384	85	to similar visual approaches such as degree histograms, adjacency Graph analytic triage, Node-neighbor centrality, Standard canonical The degree of each node is the number of links 1. Calculate the centrality (degree) of each node semi–log, inverse, and same degree offsets, are presented in Section 'optional steps of the HB algorithm.' algorithms only sample the graph data set, while the Figure 2: Visone backbone layout of jazz player data set. of Figure 5 shows which high-degree nodes are some of the highest degree nodes are not connected Figure 6: Sample directed neighbors plot for jazz player data set (Green = In, Red = Out). Figure 8: Backbone layout representation of the Toaster data set. Figure 15: HB chart of third 3,500 connections in Toaster data set. Figure 15: HB chart of third 3,500 connections in Toaster data set. Figure 14: HB chart of second 3,500 connections in Toaster data set. representation allows different node-link data sets, 	./cache/work_5q357hhw75ff3ebwvg7x5x4ssu.pdf	./txt/work_5q357hhw75ff3ebwvg7x5x4ssu.txt