Skip to main navigation Skip to search Skip to main content

Disconnected graph layout and the polyomino packing approach

  • Karlis Freivalds*
  • , Ugur Dogrusoz
  • , Paulis Kikusts
  • *Corresponding author for this work
  • University of Latvia
  • Bilkent University

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research › peer-review

21 Citations (Scopus)

Abstract

We review existing algorithms and present a new approach for layout of disconnected graphs. The new approach is based on polyomino representation of components as opposed to rectangles. The parameters of our algorithm and their influence on the drawings produced as well as a variation of the algorithm for multiple pages are discussed. We also analyze our algorithm both theoretically and experimentally and compare it with the existing ones. The new approach produces much more compact and uniform drawings than previous methods.

Original languageEnglish
Title of host publicationGraph Drawing - 9th International Symposium, GD 2001, Revised Papers
EditorsPetra Mutzel, Michael Junger, Sebastian Leipert
PublisherSpringer Verlag
Pages378-391
Number of pages14
ISBN (Print)3540433090, 9783540433095
DOIs
Publication statusPublished - 2002
Externally publishedYes
Event9th International Symposium on Graph Drawing, GD 2001 - Vienna, Austria
Duration: 23 Sept 2001 → 26 Sept 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2265 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Symposium on Graph Drawing, GD 2001
Country/TerritoryAustria
CityVienna
Period23/09/01 → 26/09/01

Fingerprint

Dive into the research topics of 'Disconnected graph layout and the polyomino packing approach'. Together they form a unique fingerprint.

Cite this