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 (143Kb) | Preview
Export as:
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zaik2007-559
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