Optimising multicast structures for grid computing
Computer Communications
| Hi-index | 0.00 |
This paper introduces a new edge length heuristicthat finds a graph layout where the edge lengths areproportional to the weights on the graph edges. Theheuristic can be used in combination with the springembedder to produce a compromise between a drawingwith an accurate presentation of edge length and adrawing with good general comprehensibility. Wedescribe our preliminary investigations in combining thetwo methods so that a user can tune their preference anddemonstrate the effectiveness of the system on bothrandomly generated graphs and graphs representing webpage similarity data.