Cluster busting in anchored graph drawing

  • Authors:
  • Kelly A. Lyons

  • Affiliations:
  • Queen's University, Kingston, Ontario

  • Venue:
  • CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

Graphs are used to model many objects in computer science, such as VLSI circuits, networks, and large software designs. Using graphs to represent complex structures and relations often simplifies the presentation of these structures. It is not surprising that there has been a recent demand for algorithms that display a graph on a two-dimensional surface so that the resulting drawing is easy to read and understand.In this paper, we present a brief survey of the field of automatic graph layout. We identify the problem of visualizing distributed systems as an area in which graph layout algorithms are often required. We discuss layout problems specific to the application of drawing graphs of distributed networks and systems, and present four algorithms for solving these problems.