Results 31 to 40 of about 57,181 (227)
A Tabu Search Based Approach for Graph Layout [PDF]
, 2014 This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing.
Rodgers, Peter, Dib, Fadi
core +1 more source
Tsinghua Science and Technology, 2014 We analyze a common feature of p-Kemeny AGGregation (p-KAGG) and p-One-Sided Crossing Minimization (p-OSCM) to provide new insights and findings of interest to both the graph drawing community and the social choice community.
Henning Fernau +5 more
doaj +1 more source
, 2004 This report describes the Eleventh Annual Graph Drawing Contest, held in conjunction with the 2004 Graph Drawing Symposium in New York, USA.
Emden Gansner +7 more
core +2 more sources
Modifying Orthogonal Drawings for Label Placement
Algorithms, 2016 In this paper, we investigate how one can modify an orthogonal graph drawing to accommodate the placement of overlap-free labels with the minimum cost (i.e., minimum increase of the area and preservation of the quality of the drawing).
Konstantinos G. Kakoulis +1 more
doaj +1 more source
Lower Bounds on the Area Requirements of Series-Parallel Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Graphs and ...
Fabrizio Frati
doaj +1 more source
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the following problem: Given $k$ paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is monotone in some direction?
David Bremner +8 more
doaj +1 more source
Drawing a Graph in a Hypercube [PDF]
The Electronic Journal of Combinatorics, 2006 A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions in hypercube drawing of a given graph.
openaire +3 more sources
Planar and poly-arc Lombardi drawings
Journal of Computational Geometry, 2018 In Lombardi drawings of graphs, edges are represented as circular arcs and the edges incident on vertices have perfect angular resolution. It is known that not every planar graph has a planar Lombardi drawing.
Christian A. Duncan +5 more
doaj +1 more source
A Mixed-Integer Program for Drawing Orthogonal Hyperedges in a Hierarchical Hypergraph
Mathematics, 2022 This paper presents a new formulation and solution of a mixed-integer program for the hierarchical orthogonal hypergraph drawing problem, and the number of hyperedge crossings is minimized. The novel feature of the model is in combining several stages of
Gregory Fridman +3 more
doaj +1 more source
On Rectilinear Drawing of Graphs [PDF]
, 2010 A rectilinear drawing is an orthogonal grid drawing without bends, possibly with edge crossings, without any overlapping between edges, between vertices, or between edges and vertices. Rectilinear drawings without edge crossings (planar rectilinear drawings) have been extensively investigated in graph drawing.
Peter Eades +2 more
openaire +1 more source