Algorithms for layout of disconnected graphs

Files

Two-dimensional packing algorithms.pdf (465.1 KB)

Date

2000

Authors

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
6
views
7
downloads

  • Share

Series

Abstract

We present efficient algorithms for the layout of disconnected objects in a graph (isolated nodes and components) for a specified aspect ratio. These linear and near-linear algorithms are based on alternate-bisection and two-dimensional packing methodologies. In addition, the parameters that affect the performance of these algorithms as well as the circumstances under which the two methodologies perform well are analyzed.

Source Title

Proceedings of the Fifth International Conference on Computer Science and Informatics, CS&I 2000

Publisher

Elsevier

Course

Other identifiers

Book Title

Keywords

Graph drawings, Graph layout, Algorithms, Aspect ratio, Graph theory, Information analysis, Problem solving, Rotation, Set theory, Computer science

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/27636

Published Version (Please cite this version)

Collections

Scholarly Publications - Computer Engineering

Language

English

Type

Conference Paper