Multi-circular Layout of Micro/Macro Graphs

We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced by a given partition of the micro-level vertices. A typical example is a social network of employees organized into different departments. We do not impose restrictions on the macro-level layout other than sufficient thickness of edges and vertices, so that the micro-level graph can be placed on top of the macrolevel graph. For the micro-level graph we define a combinatorial multicircular embedding and present corresponding layout algorithms based on edge crossing reduction strategies.

• Type: Conference
• Year: 2007
• Where: GD
• Authors: Michael Baur, Ulrik Brandes
• Keywords: Computer Graphics, GD 2007, Layout Algorithms, Macro-level Graph, Micro-level Graph