ABSTRACT
The problem of finding a pleasant layout for a given graph is a key challenge in the field of information visualization. For graphs that are biased towards a particular property such as tree-like, star-like, or bipartite, a layout algorithm can produce excellent layouts—if this property is actually detected.
Typically, a graph may not be of such a homogeneous shape but is comprised of different parts, or it provides several levels of abstraction each of which dominated by another property.
The paper in hand addresses the layout of such graphs. It presents a meta heuristic for graph drawing, which is based on two ideas: (i) The detection and exploitation of hierarchical cluster information to unveil a graph's inherent structure. (ii) The automatic selection of an individual graph drawing method for each cluster.
Index Terms
A meta heuristic for graph drawing: learning the optimal graph-drawing method for clustered graphs
Recommendations
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
FST TCS '02: Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer ScienceA three-dimensional (straight-line grid) drawing of a graph represents the vertices by points in Z 3 and the edges by noncrossing line segments. This research is motivated by the following open problem due to Felsner, Liotta, and Wismath [Graph Drawing '...
The SPQR-tree data structure in graph drawing
ICALP'03: Proceedings of the 30th international conference on Automata, languages and programmingThe data structure SPQR-tree represents the decomposition of a biconnected graph with respect to its triconnected components. SPQR-trees have been introduced by Di Battista and Tamassia [13] based on ideas by Bienstock and Monma [9, 10]. For planar ...
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admitting crossing-free h-layer drawings (for fixed h) have bounded pathwidth. We ...
Comments