Graph Thumbnails: Identifying and Comparing Multiple Graphs at a Glance

Vahan Yoghourdjian, Tim Dwyer, Karsten Klein, Kimbal Marriott, Michael Wybrow

    Research output: Contribution to journalArticleResearchpeer-review

    Abstract

    We propose Graph Thumbnails, small icon-like visualisations of the high-level structure of network data. Graph Thumbnails are designed to be legible in small multiples to support rapid browsing within large graph corpora. Compared to existing graph-visualisation techniques our representation has several advantages: (1) the visualisation can be computed in linear time; (2) it is canonical in the sense that isomorphic graphs will always have identical thumbnails; and (3) it provides precise information about the graph structure. We report the results of two user studies. The first study compares Graph Thumbnails to node-link and matrix views for identifying similar graphs. The second study investigates the comprehensibility of the different representations. We demonstrate the usefulness of this representation for summarising the evolution of protein-protein interaction networks across a range of species.

    Original languageEnglish
    Pages (from-to)1-14
    Number of pages14
    JournalIEEE Transactions on Visualization and Computer Graphics
    Volume14
    Issue number18
    DOIs
    Publication statusPublished - 2018

    Keywords

    • circle packing
    • k-connected
    • k-core decomposition
    • large networks
    • network identification
    • network visualisation

    Cite this

    @article{366845a869654933b9171b0d3d68d8de,
    title = "Graph Thumbnails: Identifying and Comparing Multiple Graphs at a Glance",
    abstract = "We propose Graph Thumbnails, small icon-like visualisations of the high-level structure of network data. Graph Thumbnails are designed to be legible in small multiples to support rapid browsing within large graph corpora. Compared to existing graph-visualisation techniques our representation has several advantages: (1) the visualisation can be computed in linear time; (2) it is canonical in the sense that isomorphic graphs will always have identical thumbnails; and (3) it provides precise information about the graph structure. We report the results of two user studies. The first study compares Graph Thumbnails to node-link and matrix views for identifying similar graphs. The second study investigates the comprehensibility of the different representations. We demonstrate the usefulness of this representation for summarising the evolution of protein-protein interaction networks across a range of species.",
    keywords = "circle packing, k-connected, k-core decomposition, large networks, network identification, network visualisation",
    author = "Vahan Yoghourdjian and Tim Dwyer and Karsten Klein and Kimbal Marriott and Michael Wybrow",
    year = "2018",
    doi = "10.1109/TVCG.2018.2790961",
    language = "English",
    volume = "14",
    pages = "1--14",
    journal = "IEEE Transactions on Visualization and Computer Graphics",
    issn = "1077-2626",
    publisher = "IEEE, Institute of Electrical and Electronics Engineers",
    number = "18",

    }

    Graph Thumbnails : Identifying and Comparing Multiple Graphs at a Glance. / Yoghourdjian, Vahan; Dwyer, Tim; Klein, Karsten; Marriott, Kimbal; Wybrow, Michael.

    In: IEEE Transactions on Visualization and Computer Graphics, Vol. 14, No. 18, 2018, p. 1-14.

    Research output: Contribution to journalArticleResearchpeer-review

    TY - JOUR

    T1 - Graph Thumbnails

    T2 - Identifying and Comparing Multiple Graphs at a Glance

    AU - Yoghourdjian, Vahan

    AU - Dwyer, Tim

    AU - Klein, Karsten

    AU - Marriott, Kimbal

    AU - Wybrow, Michael

    PY - 2018

    Y1 - 2018

    N2 - We propose Graph Thumbnails, small icon-like visualisations of the high-level structure of network data. Graph Thumbnails are designed to be legible in small multiples to support rapid browsing within large graph corpora. Compared to existing graph-visualisation techniques our representation has several advantages: (1) the visualisation can be computed in linear time; (2) it is canonical in the sense that isomorphic graphs will always have identical thumbnails; and (3) it provides precise information about the graph structure. We report the results of two user studies. The first study compares Graph Thumbnails to node-link and matrix views for identifying similar graphs. The second study investigates the comprehensibility of the different representations. We demonstrate the usefulness of this representation for summarising the evolution of protein-protein interaction networks across a range of species.

    AB - We propose Graph Thumbnails, small icon-like visualisations of the high-level structure of network data. Graph Thumbnails are designed to be legible in small multiples to support rapid browsing within large graph corpora. Compared to existing graph-visualisation techniques our representation has several advantages: (1) the visualisation can be computed in linear time; (2) it is canonical in the sense that isomorphic graphs will always have identical thumbnails; and (3) it provides precise information about the graph structure. We report the results of two user studies. The first study compares Graph Thumbnails to node-link and matrix views for identifying similar graphs. The second study investigates the comprehensibility of the different representations. We demonstrate the usefulness of this representation for summarising the evolution of protein-protein interaction networks across a range of species.

    KW - circle packing

    KW - k-connected

    KW - k-core decomposition

    KW - large networks

    KW - network identification

    KW - network visualisation

    UR - http://www.scopus.com/inward/record.url?scp=85040577801&partnerID=8YFLogxK

    U2 - 10.1109/TVCG.2018.2790961

    DO - 10.1109/TVCG.2018.2790961

    M3 - Article

    VL - 14

    SP - 1

    EP - 14

    JO - IEEE Transactions on Visualization and Computer Graphics

    JF - IEEE Transactions on Visualization and Computer Graphics

    SN - 1077-2626

    IS - 18

    ER -