Drawing Graphs using Modular Decomposition

Papadopoulos, Charis and Voglis, Constantinos (2006) Drawing Graphs using Modular Decomposition. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 343-354(Official URL: http://dx.doi.org/10.1007/11618058_31).

Full text not available from this repository.

Abstract

In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our algorithm works by traversing the modular decomposition tree of the input graph G on n vertices and m edges, in a bottom-up fashion until it reaches the root of the tree, while at the same time intermediate drawings are computed. In order to achieve aesthetically pleasing results, we use grid and circular placement techniques, and utilize an appropriate modification of a well-known spring embedder algorithm. It turns out, that for some classes of graphs, our algorithm runs in O(n+m) time, while in general, the running time is bounded in terms of the processing time of the spring embedder algorithm. The result is a drawing that reveals the structure of the graph G and preserves certain aesthetic criteria.

Item Type:	Conference Paper
Additional Information:	10.1007/11618058_31
Classifications:	M Methods > M.400 Force-directed / Energy-based P Styles > P.720 Straight-line P Styles > P.120 Circular
URI:	http://gdea.informatik.uni-koeln.de/id/eprint/703

Actions (login required)

View Item