{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:55:08Z","timestamp":1775080508243,"version":"3.50.1"},"reference-count":37,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T00:00:00Z","timestamp":1499126400000},"content-version":"vor","delay-in-days":33,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computer Graphics Forum"],"published-print":{"date-parts":[[2017,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Multivariate graphs are prolific across many fields, including transportation and neuroscience. A key task in graph analysis is the exploration of connectivity, to, for example, analyze how signals flow through neurons, or to explore how well different cities are connected by flights. While standard node\u2010link diagrams are helpful in judging connectivity, they do not scale to large networks. Adjacency matrices also do not scale to large networks and are only suitable to judge connectivity of adjacent nodes. A key approach to realize scalable graph visualization are queries: instead of displaying the whole network, only a relevant subset is shown. Query\u2010based techniques for analyzing connectivity in graphs, however, can also easily suffer from cluttering if the query result is big enough. To remedy this, we introduce techniques that provide an overview of the connectivity and reveal details on demand. We have two main contributions: (1) two novel visualization techniques that work in concert for summarizing graph connectivity; and (2) Graffinity, an open\u2010source implementation of these visualizations supplemented by detail views to enable a complete analysis workflow. Graffinity was designed in a close collaboration with neuroscientists and is optimized for connectomics data analysis, yet the technique is applicable across domains. We validate the connectivity overview and our open\u2010source tool with illustrative examples using flight and connectomics data.<\/jats:p>","DOI":"10.1111\/cgf.13184","type":"journal-article","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T15:14:58Z","timestamp":1499181298000},"page":"251-260","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Graffinity: Visualizing Connectivity in Large Graphs"],"prefix":"10.1111","volume":"36","author":[{"given":"E.","family":"Kerzner","sequence":"first","affiliation":[{"name":"University of Utah  USA"}]},{"given":"A.","family":"Lex","sequence":"additional","affiliation":[{"name":"University of Utah  USA"}]},{"given":"C.L.","family":"Sigulinsky","sequence":"additional","affiliation":[{"name":"University of Utah  USA"}]},{"given":"T.","family":"Urness","sequence":"additional","affiliation":[{"name":"Drake University  USA"}]},{"given":"B.W.","family":"Jones","sequence":"additional","affiliation":[{"name":"University of Utah  USA"}]},{"given":"R.E.","family":"Marc","sequence":"additional","affiliation":[{"name":"University of Utah  USA"}]},{"given":"M.","family":"Meyer","sequence":"additional","affiliation":[{"name":"University of Utah  USA"}]}],"member":"311","published-online":{"date-parts":[[2017,7,4]]},"reference":[{"key":"e_1_2_10_2_2","unstructured":"AndersonJ.R. JonesB.W. WattC.B. ShawM.V. YangJ.\u2010H. DeMillD. LauritzenJ.S. Yanhua Lin KevinD.RappD. M. P. K. GrimmB. TasdizenT. WhitakerR. MarcR.E.: Exploring the retinal connectome.Mol Vis(2011).7"},{"key":"e_1_2_10_3_2","first-page":"1","article-title":"The Viking viewer for connectomics: Scalable multi\u2010user annotation and summarization of large volume data sets","volume":"241","author":"Anderson J.R.","year":"2010","journal-title":"Journal of Microscopy"},{"key":"e_1_2_10_4_2","first-page":"3","article-title":"Ranking complex relationships on the semantic web","volume":"9","author":"Aleman\u2010Meza B.","year":"2005","journal-title":"IEEE Internet Comp"},{"key":"e_1_2_10_5_2","volume-title":"Network Science","author":"Barabasi A.\u2010L.","year":"2016"},{"key":"e_1_2_10_6_2","first-page":"1","article-title":"A taxonomy and survey of dynamic graph visualization","volume":"36","author":"Beck F.","year":"2017","journal-title":"CGF"},{"key":"e_1_2_10_7_2","first-page":"3","article-title":"Matrix reordering methods for table and network visualization","volume":"35","author":"Behrisch M.","year":"2016","journal-title":"CGF"},{"key":"e_1_2_10_8_2","first-page":"6","article-title":"Portraits of complex networks","volume":"81","author":"Bagrow J.P.","journal-title":"Europhysics Letters"},{"key":"e_1_2_10_9_2","doi-asserted-by":"crossref","unstructured":"BastianM. HeymannS. JacomyM.: Gephi: an open source software for exploring and manipulating networks. InProc. ICWSM(2009).3","DOI":"10.1609\/icwsm.v3i1.13937"},{"key":"e_1_2_10_10_2","unstructured":"U.S. Bureau of Transportation Statistics Air Carriers: T\u2010100 Domestic Market (All Carriers).http:\/\/transtats.bts.gov\/(2016).5"},{"key":"e_1_2_10_11_2","doi-asserted-by":"crossref","unstructured":"CzechW.: Graph descriptors from B\u2010matrix representation. InGraph\u2010Based Rep. in Pattern Recognition(2011).3","DOI":"10.1007\/978-3-642-20844-7_2"},{"key":"e_1_2_10_12_2","doi-asserted-by":"crossref","unstructured":"ElmqvistN. DoT.N. GoodellH. HenryN. FeketeJ.D.: ZAME: Interactive large\u2010scale graph visualization. InIEEE Pacific Vis. Symp. (2008).4","DOI":"10.1109\/PACIFICVIS.2008.4475479"},{"key":"e_1_2_10_13_2","unstructured":"FeketeJ.\u2010d.: Reorder.js : A JavaScript library to reorder tables and Networks. InIEEE Vis (Posters)(2015).7"},{"key":"e_1_2_10_14_2","doi-asserted-by":"crossref","unstructured":"FisherD. PopovI. DruckerS. SchraefelM.: Trust me I'm partially right: incremental visualization lets analysts explore large datasets faster. InProc. CHI(2012).9","DOI":"10.1145\/2207676.2208294"},{"key":"e_1_2_10_15_2","first-page":"12","article-title":"Creative user\u2010centered design for energy analysts and modelers","volume":"19","author":"Goodwin S.","year":"2013","journal-title":"IEEE TVCG"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.ivs.9500092"},{"key":"e_1_2_10_17_2","doi-asserted-by":"crossref","unstructured":"HenryN. FeketeJ.\u2010d.: MatLink: enhanced matrix visualization for analyzing social networks. InProc. Interact(2007).3","DOI":"10.1007\/978-3-540-74800-7_24"},{"key":"e_1_2_10_18_2","doi-asserted-by":"crossref","unstructured":"HeimP. HellmannS. LehmannJ. LohmannS. StegemannT.: RelFinder: revealing relationships in RDF knowledge bases. InProc. Semantic and Digital Media Tech. (2009).2 3","DOI":"10.1007\/978-3-642-10543-2_21"},{"key":"e_1_2_10_19_2","unstructured":"HoltzblattK. JonesS.: Contextual inquiry: a participatory technique for system design. InParticipatory design: principles and practice.1993.2 7"},{"key":"e_1_2_10_20_2","doi-asserted-by":"crossref","unstructured":"KairamS. MacLeanD. SavvaM. HeerJ.: Graph\u2010Prism: compact visualization of network structure.Proc. AVI(2012).3","DOI":"10.1145\/2254556.2254651"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06793-3"},{"key":"e_1_2_10_22_2","doi-asserted-by":"crossref","unstructured":"LeeB. PlaisantC. ParrC.S. FeketeJ.\u2010D. HenryN.: Task taxonomy for graph visualization. InProc. BELIV(2006).2","DOI":"10.1145\/1168149.1168168"},{"key":"e_1_2_10_23_2","unstructured":"LauritzenJ.S. SigulinskyC.L. AndersonJ.R. KalloniatisM. NelsonN.T. EmrichD.P. RappC. MccarthyN. KerznerE. MeyerM. JonesB.W. MarcR.E.: Rod\u2010cone crossover connectome of mammalian bipolar cells.Journal of Comparative Neurology(2016).2 8"},{"key":"e_1_2_10_24_2","unstructured":"MutzelP. JungerM.: Tulip: a huge graph visualisation framework. InGraph Drawing Software.2004.3"},{"key":"e_1_2_10_25_2","unstructured":"Neo4j Graph Database.http:\/\/neo4j.com\/(2016).3 6"},{"key":"e_1_2_10_26_2","first-page":"3","article-title":"Pathfinder: visual analysis of paths in graphs","volume":"35","author":"Partl C.","year":"2016","journal-title":"CGF"},{"key":"e_1_2_10_27_2","unstructured":"PretoriousA.J. PurchaseH.C. StaskoJ.T.: Tasks for multivariate network analysis.Lecture Notes in Computer Science 8380(2013).2"},{"key":"e_1_2_10_28_2","first-page":"5","article-title":"Network visualization by meaningful substrates","volume":"12","author":"Shneiderman B.","year":"2006","journal-title":"IEEE TVCG"},{"key":"e_1_2_10_29_2","unstructured":"ShenZ. MaK.\u2010l.: Path visualization for adjacency matrices.Proc. EuroVis(2007).3"},{"key":"e_1_2_10_30_2","doi-asserted-by":"crossref","unstructured":"TuY. ShenH.W.: GraphCharter: combining browsing with query to explore large semantic graphs. InIEEE Pacific Vis. Symp(2013).2 3","DOI":"10.1109\/PacificVis.2013.6596127"},{"key":"e_1_2_10_31_2","first-page":"12","article-title":"Multivariate network exploration and presentation: from detail to overview via selections and aggregations","volume":"20","author":"van den Elzen S.","year":"2014","journal-title":"IEEE TVCG"},{"key":"e_1_2_10_32_2","first-page":"6","article-title":"\u201cSearch, show context, expand on demand\u201d: Supporting large graph exploration with degree\u2010of\u2010interest","volume":"15","author":"Van Ham F.","year":"2009","journal-title":"IEEE TVCG"},{"key":"e_1_2_10_33_2","doi-asserted-by":"crossref","unstructured":"van HamF. SchulzH.\u2010j. DimiccoJ.M.: Honeycomb: Visual Analysis of Large Scale Social Networks. InProc. Interact(2009).3","DOI":"10.1007\/978-3-642-03658-3_47"},{"key":"e_1_2_10_34_2","first-page":"6","article-title":"Visual analysis of large graphs: state\u2010of\u2010the\u2010art and future research challenges","volume":"30","author":"von Landesberger T.","year":"2011","journal-title":"CGF"},{"key":"e_1_2_10_35_2","doi-asserted-by":"crossref","unstructured":"WattenbergM.: Visual exploration of multivariate graphs. InProc. CHI(2006).3 9","DOI":"10.1145\/1124772.1124891"},{"key":"e_1_2_10_36_2","first-page":"1","article-title":"Many\u2010to\u2010many geographically\u2010embedded flow visualisation: an evaluation","volume":"23","author":"Yang Y.","year":"2016","journal-title":"IEEE TVCG"},{"key":"e_1_2_10_37_2","unstructured":"ZhangY. ChengG. QuY.: RelClus: Clustering\u2010based relationship search.CEUR Workshop Proc. 1035(2013).2 3"},{"key":"e_1_2_10_38_2","doi-asserted-by":"crossref","unstructured":"ZhaoJ. GlueckM. ChevalierF. WuY. KhanA.: Egocentric analysis of dynamic networks with EgoLines. InProc. CHI(2016).3","DOI":"10.1145\/2858036.2858488"}],"container-title":["Computer Graphics Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fcgf.13184","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/cgf.13184","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1111\/cgf.13184","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/cgf.13184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,9]],"date-time":"2023-09-09T18:51:36Z","timestamp":1694285496000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/cgf.13184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["10.1111\/cgf.13184"],"URL":"https:\/\/doi.org\/10.1111\/cgf.13184","archive":["Portico"],"relation":{},"ISSN":["0167-7055","1467-8659"],"issn-type":[{"value":"0167-7055","type":"print"},{"value":"1467-8659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6]]},"assertion":[{"value":"2017-07-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}