Results 21 to 30 of about 51,611 (258)
Journal of Graph Algorithms and Applications, 2017 One of the most popular hierarchical graph drawing frameworks - the Sugiyama, Tagawa, and Toda (STT) framework - often introduces dummy vertices to the given directed acyclic graph as part of its methodology to produce the final drawing. The inclusion of
Daniel Summer Magruder, Stefan Bonn
doaj +1 more source
Convex Grid Drawings of Plane Graphs with Rectangular Contours
Journal of Graph Algorithms and Applications, 2008 In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex grid drawing, all vertices are put on grid points.
Kazuyuki Miura +2 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
Graph Drawing by High-Dimensional Embedding
Journal of Graph Algorithms and Applications, 2004 We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2-D plane using principal components analysis. Running time is linear in the
David Harel, Yehuda Koren
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
Box-Rectangular Drawings of Planar Graphs
Journal of Graph Algorithms and Applications, 2013 A plane graph is a planar graph with a fixed planar embedding in the plane. In a box- rectangular drawing of a plane graph, every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line ...
Md. Manzurul Hasan +2 more
doaj +1 more source
Energy Models for Graph Clustering
Journal of Graph Algorithms and Applications, 2007 The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software systems.
Andreas Noack
doaj +1 more source
Drawing Planar Graphs with Reduced Height
Journal of Graph Algorithms and Applications, 2017 A polyline (resp., straight-line) drawing $\Gamma$ of a planar graph $G$ on a set $L_k$ of $k$ parallel lines is a planar drawing that maps each vertex of $G$ to a distinct point on $L_k$ and each edge of $G$ to a polygonal chain (resp ...
Stephane Durocher, Debajyoti Mondal
doaj +1 more source
The Straight-Line RAC Drawing Problem is NP-Hard
Journal of Graph Algorithms and Applications, 2012 A RAC drawing of a graph is a polyline drawing in which every pair of crossing edges intersects at right angle. In this paper, we focus on straight-line RAC drawings and demonstrate an infinite class of graphs with unique RAC combinatorial embedding.
Evmorfia Argyriou +2 more
doaj +1 more source
Journal of Graph Algorithms and Applications, 2013 Optical graph recognition (OGR) reverses graph drawing. A drawing transforms the topological structure of a graph into a graphical representation. Primarily, it maps vertices to points and displays them by icons, and it maps edges to Jordan curves ...
Christopher Auer +4 more
doaj +1 more source