Skip to main content

Visualizing Weighted Edges in Graphs

Rodgers, P., Mutton, P. (2003) Visualizing Weighted Edges in Graphs. In: Seventh International Conference On Information Visualization, Proceedings. IEEE International Conference on Information Visualisation . pp. 258-263. IEEE ISBN 0-7695-1988-1. (doi:10.1109/IV.2003.1217988) (KAR id:13954)

PDF
Language: English
Download (333kB) Preview
[thumbnail of content.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL
http://dx.doi.org/10.1109/IV.2003.1217988

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.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1109/IV.2003.1217988
Uncontrolled keywords: Graph Drawing, Metric Embedding, Graph Visualization
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Peter Rodgers
Date Deposited: 24 Nov 2008 18:01 UTC
Last Modified: 16 Feb 2021 12:24 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/13954 (The current URI for this page, for reference purposes)
Rodgers, P.: https://orcid.org/0000-0002-4100-3596
  • Depositors only (login required):

Downloads

Downloads per month over past year