{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T10:16:26Z","timestamp":1761992186714,"version":"build-2065373602"},"reference-count":32,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T00:00:00Z","timestamp":1467590400000},"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":[[2016,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The analysis of paths in graphs is highly relevant in many domains. Typically, path\u2010related tasks are performed in node\u2010link layouts. Unfortunately, graph layouts often do not scale to the size of many real world networks. Also, many networks are multivariate, i.e., contain rich attribute sets associated with the nodes and edges. These attributes are often critical in judging paths, but directly visualizing attributes in a graph layout exacerbates the scalability problem. In this paper, we present visual analysis solutions dedicated to path\u2010related tasks in large and highly multivariate graphs. We show that by focusing on paths, we can address the scalability problem of multivariate graph visualization, equipping analysts with a powerful tool to explore large graphs. We introduce Pathfinder, a technique that provides visual methods to query paths, while considering various constraints. The resulting set of paths is visualized in both a ranked list and as a node\u2010link diagram. For the paths in the list, we display rich attribute data associated with nodes and edges, and the node\u2010link diagram provides topological context. The paths can be ranked based on topological properties, such as path length or average node degree, and scores derived from attribute data. Pathfinder is designed to scale to graphs with tens of thousands of nodes and edges by employing strategies such as incremental query results. We demonstrate Pathfinder's fitness for use in scenarios with data from a coauthor network and biological pathways.<\/jats:p>","DOI":"10.1111\/cgf.12883","type":"journal-article","created":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T13:54:40Z","timestamp":1467640480000},"page":"71-80","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Pathfinder: Visual Analysis of Paths in Graphs"],"prefix":"10.1111","volume":"35","author":[{"given":"C.","family":"Partl","sequence":"first","affiliation":[{"name":"Graz University of Technology  Austria"}]},{"given":"S.","family":"Gratzl","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz  Austria"}]},{"given":"M.","family":"Streit","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz  Austria"}]},{"given":"A. M.","family":"Wassermann","sequence":"additional","affiliation":[{"name":"Pfizer  USA"}]},{"given":"H.","family":"Pfister","sequence":"additional","affiliation":[{"name":"Harvard University  USA"}]},{"given":"D.","family":"Schmalstieg","sequence":"additional","affiliation":[{"name":"Graz University of Technology  Austria"}]},{"given":"A.","family":"Lex","sequence":"additional","affiliation":[{"name":"University of Utah  USA"}]}],"member":"311","published-online":{"date-parts":[[2016,7,4]]},"reference":[{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/1124772.1124889"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.109"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2005.63"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060766"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature11003"},{"key":"e_1_2_9_7_2","doi-asserted-by":"crossref","unstructured":"BastianM. HeymannS. JacomyM.:Gephi: An Open Source Software for Exploring and Manipulating Networks. InThird International AAAI Conference on Weblogs and Social Media(2009). URL:http:\/\/www.aaai.org\/ocs\/index.php\/ICWSM\/09\/paper\/view\/154. 3","DOI":"10.1609\/icwsm.v3i1.13937"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11915-1_27"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2207676.2208294"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01451.x"},{"volume-title":"Poster Compendium of the IEEE Conference on Information Visualization (InfoVis \u201915)","year":"2015","author":"Gratzl S.","key":"e_1_2_9_11_2"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.173"},{"key":"e_1_2_9_13_2","first-page":"288","volume-title":"no. 4663 in Lecture Notes in Computer Science","author":"Henry N.","year":"2007"},{"key":"e_1_2_9_14_2","first-page":"182","volume-title":"no. 5887 in Lecture Notes in Computer Science","author":"Heim P.","year":"2009"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1177\/1473871612462152"},{"volume":"2015","journal-title":"Visualization Publication Dataset","author":"Isenberg P.","key":"e_1_2_9_16_2"},{"volume-title":"Lecture notes in computer science","year":"2014","author":"Kerren A.","key":"e_1_2_9_17_2"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346248"},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.154"},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.106"},{"key":"e_1_2_9_21_2","doi-asserted-by":"crossref","unstructured":"LeeB. PlaisantC. ParrC.S. FeketeJ.\u2010D. HenryN.:Task Taxonomy for Graph Visualization. InProceedings of the AVI Workshop on BEyond time and errors: novel evaluation methods for information visualization (BELIV \u201906)(2006) pp.1\u20135. doi:10.1145\/1168149.1168168. 2 9","DOI":"10.1145\/1168149.1168168"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2012.03.017"},{"volume-title":"Poster Compendium of the IEEE Conference on Information Visualization (InfoVis \u201915)","year":"2015","author":"Luger S.","key":"e_1_2_9_23_2"},{"key":"e_1_2_9_24_2","unstructured":"PettittC.:dagre \u2010 Graph layout for JavaScript Mar.2016. URL:https:\/\/github.com\/cpettitt\/dagre7"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S19-S3"},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1038\/sj.onc.1210422"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.2312\/VisSym\/EuroVis07\/083-090"},{"key":"e_1_2_9_28_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq675"},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1117\/12.761555"},{"key":"e_1_2_9_30_2","doi-asserted-by":"crossref","unstructured":"Vehlow Corinna Beck Fabian Weiskopf Daniel:The State of the Art in Visualizing Group Structures in Graphs. InEurographics Conference on Visualization (EuroVis) \u2010 STARs(2015). doi:10.2312\/eurovisstar.20151110. 3 6","DOI":"10.1111\/cgf.12872"},{"key":"e_1_2_9_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2009.108"},{"key":"e_1_2_9_32_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01898.x"},{"key":"e_1_2_9_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06826-8\\_21"}],"container-title":["Computer Graphics Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fcgf.12883","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/cgf.12883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T05:48:04Z","timestamp":1696398484000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/cgf.12883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1111\/cgf.12883"],"URL":"https:\/\/doi.org\/10.1111\/cgf.12883","archive":["Portico"],"relation":{},"ISSN":["0167-7055","1467-8659"],"issn-type":[{"type":"print","value":"0167-7055"},{"type":"electronic","value":"1467-8659"}],"subject":[],"published":{"date-parts":[[2016,6]]},"assertion":[{"value":"2016-07-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}