Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

IV
2003
IEEE

favoriteEmaildiscussreport

92views Visualization» more IV 2003»

Visualizing Weighted Edges in Graphs

13 years 9 months ago

Visualizing Weighted Edges in Graphs

Download www.cs.kent.ac.uk

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.

Peter Rodgers, Paul Mutton

Real-time Traffic

Edge Length | Graph Edges | Graph Layout | Information Technology | IV 2003 |

claim paper

Related Content

» Spectral Analysis of Signed Graphs for Clustering Prediction and Visualization

» A Linear Algorithm for Finding the Invariant Edges of an EdgeWeighted Graph

» The Max kCut Game and Its Strong Equilibria

» TimeRadarTrees Visualizing Dynamic Compound Digraphs

» Continuous nonlinear dimensionality reduction by kernel Eigenmaps

» Heavy cycles in kconnected weighted graphs with large weighted degree sums

» A Simple and Fast Mincut Algorithm

» Simultaneous Graph Drawing Layout Algorithms and Visualization Schemes

» A General Framework for Graph Sparsification

Post Info
More Details (n/a)

Added	04 Jul 2010
Updated	04 Jul 2010
Type	Conference
Year	2003
Where	IV
Authors	Peter Rodgers, Paul Mutton

Comments (0)