Drawing cycles in networks

Buchheim, Christoph and J√ľnger, Michael and Percan, Merijam and Schulz, Michael and Thelen, Christina (2007) Drawing cycles in networks.
Technical Report , 8 p.

Abstract

In this paper we show how a graph that contains a specified cycle can be drawn in the plane such that the cycle is drawn circularly while the rest of the graph is layouted orthogonally. We also show how to extend this algorithm to deal with a set of disjoint cycles at once.


Actions:
Download: [img] PDF
Download (147kB) | Preview
Export as: [error in script]
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Paper (Technical Report)
Citations: [error in script] 0 (Google Scholar) | [error in script]
Uncontrolled Keywords: [error in script]
Subjects:
  • 05-XX Combinatorics > 05Cxx Graph theory > 05C85 Graph algorithms

  • 92-XX Biology and other natural sciences > 92-08 Computational methods

  • 05-XX Combinatorics > 05Cxx Graph theory > 05C20 Directed graphs (digraphs), tournaments

  • Uncontrolled Keywords: bioinformatics, crossing minimization, directed edges, cycles, graph drawing
    Subjects: 05-XX Combinatorics > 05Cxx Graph theory > 05C85 Graph algorithms
    92-XX Biology and other natural sciences > 92-08 Computational methods
    05-XX Combinatorics > 05Cxx Graph theory > 05C20 Directed graphs (digraphs), tournaments
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger
    Depositing User: Christoph Buchheim
    Date Deposited: 10 Mar 2008 00:00
    Last Modified: 09 Jan 2012 16:54
    Deposit Information:
    ZAIK Number: [error in script]
    Depositing User: Christoph Buchheim
    Date Deposited: 10 Mar 2008 00:00
    Last Modified: 09 Jan 2012 16:54
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/559