Results 41 to 50 of about 1,651,918 (300)
Graph Algorithm Animation with Grrr [PDF]
, 2000 We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers +3 more
core +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
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
Graph-Drawing Contest Report [PDF]
, 2001 This report describes the Seventh Annual Graph Drawing Contest, held in conjunction with the 2000 Graph Drawing Symposium in Williamsburg, Virginia. The purpose of the contest is to monitor and challenge the current state of the art in graph-drawing ...
Himsolt, Michael +7 more
core +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
Computational Geometry, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
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
Every Graph Admits an Unambiguous Bold Drawing
, 2012 Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a
János Pach, Pach, János
core +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
Demonstration of a Preprocessor for the Spring Embedder [PDF]
, 2002 Spring embedding is a widely used method for producing automated layouts of graphs. We present a preprocessor that improves the performance of the classical spring embedder which can be used in conjunction with other optimization and approximation ...
Rodgers, Peter +3 more
core +1 more source