Centrality based visualization of small world graphs

F.J.J. Ham, van, M. Wattenberg

    Research output: Contribution to journalArticleAcademicpeer-review

    38 Citations (Scopus)

    Abstract

    Current graph drawing algorithms enable the creation of two dimensional node-link diagrams of huge graphs. However, for graphs with low diameter (of which "small world" graphs are a subset) these techniques begin to break down visually even when the graph has only a few hundred nodes. Typical algorithms produce images where nodes clump together in the center of the screen, making it hard to discern structure and follow paths. This paper describes a solution to this problem, which uses a global edge metric to determine a subset of edges that capture the graph's intrinsic clustering structure. This structure is then used to create an embedding of the graph, after which the remaining edges are added back in. We demonstrate applications of this technique to a number of real world examples.
    Original languageEnglish
    Pages (from-to)975-982
    JournalComputer Graphics Forum
    Volume27
    Issue number3
    DOIs
    Publication statusPublished - 2008

    Fingerprint

    Dive into the research topics of 'Centrality based visualization of small world graphs'. Together they form a unique fingerprint.

    Cite this