Visualizing Weighted Edges in Graphs

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.

• Type: Conference
• Year: 2003
• Where: IV
• Authors: Peter Rodgers, Paul Mutton
• Keywords: Edge Length, Graph Edges, Graph Layout, Information Technology, IV 2003