No Cover Image

Journal article 1230 views

The Readability of Path-Preserving Clusterings of Graphs

Daniel Archambault Orcid Logo, Helen C Purchase, Bruno Pinaud

Computer Graphics Forum, Volume: 29, Issue: 3, Pages: 1173 - 1182

Swansea University Author: Daniel Archambault Orcid Logo

Full text not available from this repository: check for access using links below.

Check full text

DOI (Published version): 10.1111/j.1467-8659.2009.01683.x

Abstract

Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving way based on attribute values associated with the nodes of the graph. Despite extensive use of these representations, as fa...

Full description

Published in: Computer Graphics Forum
ISSN: 0167-7055
Published: 2010
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa13912
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2013-07-23T12:11:18Z
last_indexed 2018-02-09T04:44:58Z
id cronfa13912
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2015-07-01T12:45:36.7145941</datestamp><bib-version>v2</bib-version><id>13912</id><entry>2013-01-18</entry><title>The Readability of Path-Preserving Clusterings of Graphs</title><swanseaauthors><author><sid>8fa6987716a22304ef04d3c3d50ef266</sid><ORCID>0000-0003-4978-8479</ORCID><firstname>Daniel</firstname><surname>Archambault</surname><name>Daniel Archambault</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2013-01-18</date><deptcode>SCS</deptcode><abstract>Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving way based on attribute values associated with the nodes of the graph. Despite extensive use of these representations, as far as we know, no formal experimentation exists to evaluate if they improve the readability of graphs. In this paper, we present the results of a user study that formally evaluates how such representations affect the readability of graphs. We also explore the effect of graph size and connectivity in terms of this primary research question. Overall, for our tasks, we did not find a significant difference when this clustering is used. However, if the graph is highly connected, these clusterings can improve performance. Also, if the graph is large enough and can be simplified into a few metanodes, benefits in performance on global tasks are realized. Under these same conditions, however, performance of local attribute tasks may be reduced.</abstract><type>Journal Article</type><journal>Computer Graphics Forum</journal><volume>29</volume><journalNumber>3</journalNumber><paginationStart>1173</paginationStart><paginationEnd>1182</paginationEnd><publisher/><issnPrint>0167-7055</issnPrint><issnElectronic/><keywords/><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2010</publishedYear><publishedDate>2010-12-31</publishedDate><doi>10.1111/j.1467-8659.2009.01683.x</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2015-07-01T12:45:36.7145941</lastEdited><Created>2013-01-18T12:33:15.9025958</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Daniel</firstname><surname>Archambault</surname><orcid>0000-0003-4978-8479</orcid><order>1</order></author><author><firstname>Helen C</firstname><surname>Purchase</surname><order>2</order></author><author><firstname>Bruno</firstname><surname>Pinaud</surname><order>3</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2015-07-01T12:45:36.7145941 v2 13912 2013-01-18 The Readability of Path-Preserving Clusterings of Graphs 8fa6987716a22304ef04d3c3d50ef266 0000-0003-4978-8479 Daniel Archambault Daniel Archambault true false 2013-01-18 SCS Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving way based on attribute values associated with the nodes of the graph. Despite extensive use of these representations, as far as we know, no formal experimentation exists to evaluate if they improve the readability of graphs. In this paper, we present the results of a user study that formally evaluates how such representations affect the readability of graphs. We also explore the effect of graph size and connectivity in terms of this primary research question. Overall, for our tasks, we did not find a significant difference when this clustering is used. However, if the graph is highly connected, these clusterings can improve performance. Also, if the graph is large enough and can be simplified into a few metanodes, benefits in performance on global tasks are realized. Under these same conditions, however, performance of local attribute tasks may be reduced. Journal Article Computer Graphics Forum 29 3 1173 1182 0167-7055 31 12 2010 2010-12-31 10.1111/j.1467-8659.2009.01683.x COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2015-07-01T12:45:36.7145941 2013-01-18T12:33:15.9025958 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Daniel Archambault 0000-0003-4978-8479 1 Helen C Purchase 2 Bruno Pinaud 3
title The Readability of Path-Preserving Clusterings of Graphs
spellingShingle The Readability of Path-Preserving Clusterings of Graphs
Daniel Archambault
title_short The Readability of Path-Preserving Clusterings of Graphs
title_full The Readability of Path-Preserving Clusterings of Graphs
title_fullStr The Readability of Path-Preserving Clusterings of Graphs
title_full_unstemmed The Readability of Path-Preserving Clusterings of Graphs
title_sort The Readability of Path-Preserving Clusterings of Graphs
author_id_str_mv 8fa6987716a22304ef04d3c3d50ef266
author_id_fullname_str_mv 8fa6987716a22304ef04d3c3d50ef266_***_Daniel Archambault
author Daniel Archambault
author2 Daniel Archambault
Helen C Purchase
Bruno Pinaud
format Journal article
container_title Computer Graphics Forum
container_volume 29
container_issue 3
container_start_page 1173
publishDate 2010
institution Swansea University
issn 0167-7055
doi_str_mv 10.1111/j.1467-8659.2009.01683.x
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 0
active_str 0
description Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving way based on attribute values associated with the nodes of the graph. Despite extensive use of these representations, as far as we know, no formal experimentation exists to evaluate if they improve the readability of graphs. In this paper, we present the results of a user study that formally evaluates how such representations affect the readability of graphs. We also explore the effect of graph size and connectivity in terms of this primary research question. Overall, for our tasks, we did not find a significant difference when this clustering is used. However, if the graph is highly connected, these clusterings can improve performance. Also, if the graph is large enough and can be simplified into a few metanodes, benefits in performance on global tasks are realized. Under these same conditions, however, performance of local attribute tasks may be reduced.
published_date 2010-12-31T03:15:54Z
_version_ 1763750292805910528
score 11.017797

Similar Items