Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael, Kandyba, Maria, Percan, Merijam and Schulz, Michael (2007). Planarization With Fixed Subgraph Embedding. Working Paper.

[img]
Preview
 PDF
zaik2007-566.pdf
Download (154kB) | Preview

Abstract

The visualization of metabolic networks using techniques of graph drawing has recently become an important research area. In order to ease the analysis of these networks, readable layouts are required in which certain known network components are easily recognizable. In general, the topology of the drawings produced by traditional graph drawing algorithms does not reflect the biologists' expert knowledge on particular substructures of the underlying network. To deal with this problem we present a constrained planarization method---an algorithm which computes a graph layout in the plane preserving the predefined shape for the specified substructures while minimizing the overall number of edge-crossings.

Item Type: Preprints, Working Papers or Reports (Working Paper)
Creators:
CreatorsEmailORCIDORCID Put Code
Buchheim, ChristophUNSPECIFIEDorcid.org/0000-0001-9974-404XUNSPECIFIED
Jünger, MichaelUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Kandyba, MariaUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Percan, MerijamUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Schulz, MichaelUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
URN: urn:nbn:de:hbz:38-549257
Date: 2007
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: No
URI: http://kups.ub.uni-koeln.de/id/eprint/54925

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item