Algorithms for Drawing Clustered Graphs

Algorithms for Drawing Clustered Graphs (1997)

by Qingwen Feng

Citations:

24 - 2 self

User correction supplied by mph

Datum	Value	Source
TITLE	Algorithms for Drawing Clustered Graphs	user correction - Legacy Corrections
AUTHOR NAME	Qingwen Feng	user correction
AUTHOR AFFIL	Newcastle	user correction
ABSTRACT	In the mid 1980s, graphics workstations became the main platforms for software and information engineers. Since then, visualization of relational information has become an essential element of software systems. Graphs are commonly used to model relational information. They are depicted on a graphics workstation as graph drawings. The usefulness of the relational model depends on whether the graph drawings effectively convey the relational information to the users. This thesis is concerned with finding good drawings of graphs. As the amount of information that we want to visualize becomes larger and the relations become more complex, the classical graph model tends to be inadequate. Many extended models use a node hierarchy to help cope with the complexity. This thesis introduces a new graph model called the clustered graph. The central theme of the thesis is an investigation of efficient algorithms to produce good drawings for clustered graphs. Although the criteria for judging the qua...	user correction - Legacy Corrections
YEAR	1997	user correction - Legacy Corrections
CITATIONS	66 found	ParsCit 1.0