The Layout Problem for Graphs

Abstract

The layout problem for graphs, the problem of automatically generating a representation of a graph on a two-dimensional surface, has been of interest in specific applications for many years, although little work has been done on the general problem. In the paper three approaches are taken towards solution of the problem. The first approach defines general layout qualities believed to be desirable. The second approach considers layout from an application dependent point of view. A classification of layouts into types is developed according to application, and layout algorithms for each type are discussed. The third approach, that of considering the layout of modifications of graphs, rather than layout of whole graphs, is briefly considered.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1971
Accession Number
AD0734037

Entities

People

  • Martha G. Dennis

Organizations

  • Harvard University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computer Languages
  • Computers
  • Contracts
  • Determinants (Mathematics)
  • Diagrams
  • Equations
  • Graph Theory
  • Inequalities
  • Law
  • Observation
  • Psychology
  • Reliability
  • Three Dimensional
  • Two Dimensional
  • Visual Perception

Fields of Study

  • Engineering

Readers

  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design