Crossings in Clustered Level Graphs

Clustered graphs are an enhanced graph model with a recursive clustering of the vertices according to a given nesting relation. This prime technique for expressing coherence of certain parts of the graph is used in many applications, such as biochemical pathways and UML class diagrams. For directed clustered graphs usually level drawings are used, leading to clustered level graphs. In this thesis we analyze the interrelation of clusters and levels and their influence on edge crossings and cluster/edge crossings.

Level thesis:degree_level

thesis.doctoral

Grantor dc:publisher

Universität Passau

Year

2005

Author dc:creator

• Forster, Michael

Contributors dc:contributor

• Brandenburg, Franz J.

• graph drawing
• directed acyclic graph
• cluster
• crossing
• minimization
• planar graph
• constraint
• crossing number

Statement dc:rights

• Standardbedingung laut Einverständniserklärung

Repository record source_url

https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/44

OAI identifier oai:identifier

oai:kobv.de-opus4-uni-passau:44