Paper Info
Title
Area-Efficient Static and Incremental Graph Drawings
Abstract
. In this paper, we present algorithms to produce orthogonal drawingsof arbitrary graphs. As opposed to most known algorithms, we do not restrictourselves to graphs with maximum degree 4. The best previous result gave an(m \Gamma 1) \Theta (m2 + 1)-grid for graphs with n nodes and m edges.We present algorithms for two scenarios. In the static scenario, the graph isgiven completely in advance. We produce a drawing on a grid of size at mostm+n2\Thetam+n2, or on a larger grid...
Year
DOI
Venue
1997
10.1007/3-540-63397-9_4
ESA
Keywords
Field
DocType
incremental graph drawings,area-efficient static,maximum degree,graph drawing
Graph,Discrete mathematics,Combinatorics,Computational geometry,Degree (graph theory),Connectivity,Time complexity,1-planar graph,Planar graph,Mathematics
Conference
ISBN
Citations 
PageRank 
3-540-63397-9
38
1.58
References 
Authors
10
2
Name
Order
Citations
PageRank
Therese Biedl1902106.36
Michael Kaufmann236125.45