School of Computing

Visualizing Weighted Edges in Graphs

Peter Rodgers and Paul Mutton

In Seventh International Conference on Information Visualization (IV03), pages 182-196. IEEE, July 2003.

Abstract

This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in combination with the spring embedder to produce a compromise between a drawing with an accurate presentation of edge length and a drawing with good general comprehensibility. We describe our preliminary investigations in combining the two methods so that a user can tune their preference and demonstrate the effectiveness of the system on both randomly generated graphs and graphs representing web page similarity data.

Download publication 460 kbytes (PDF)

Bibtex Record

@inproceedings{1651,
author = {Peter Rodgers and Paul Mutton},
title = {{Visualizing Weighted Edges in Graphs}},
month = {July},
year = {2003},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2003/1651},
    publication_type = {inproceedings},
    submission_id = {9553_1058856862},
    ISBN = {0-76951988-1},
    booktitle = {Seventh International Conference on Information Visualization (IV03)},
    publisher = {IEEE},
    refereed = {yes},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014