Institut für Informatik | Sitemap | LMU-Portal
English
  • Startseite
  • Studieninteressierte
  • Studierende
  • Lehrveranstaltungen
  • Forschung
    • Publikationen
    • Partner
  • Personen
  • Kontakt
  • Besucher
  • Jobs
  • FAQ
  • Intern

Publikations-Information

[Download PDF]
Download
Paul Holleis, Thomas Zimmermann, Daniel Gmach
Drawing Graphs Within Graphs
Journal of Graph Applications and Algorithms, JGAA, ISSN 1526-1719, Volume 9, no. 1, 2005
  The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality. We introduce connection sets stressing relationships between several subgraphs. In a case study, we demonstrate how they can be used to visualize connections between many small network motifs. This paper is based on a submission to the Graph Drawing Contest 2003 “Drawing Graphs within Graphs” [5]. The intent of the contest was to encourage research concerned with layouts of subgraphs.
Nach oben
Impressum – Datenschutz – Kontakt  |  Letzte Änderung am 05.02.2007 von Richard Atterer (rev 1481)