Results 81 to 90 of about 424,447 (182)
Detailed Examples of Figure Preparation in the Two Most Common Graph Layouts
Applied SciencesGraphs are an excellent tool with applications in various branches of engineering. Graph layouts have emerged as a cornerstone in the visual representation and analysis of complex systems. They are indispensable in reducing complexity, optimizing designs,
Izolda Gorgol, Hubert Salwa
doaj +1 more source
Drawing Big Graphs using Spectral Sparsification
, 2017 Spectral sparsification is a general technique developed by Spielman et al. to reduce the number of edges in a graph while retaining its structural properties.
Eades, Peter +2 more
core +1 more source
$\beta$-Stars or On Extending a Drawing of a Connected Subgraph
, 2018 We consider the problem of extending the drawing of a subgraph of a given plane graph to a drawing of the entire graph using straight-line and polyline edges.
Emilio Di Giacomo +12 more
core +1 more source
The Complexity of Drawing Graphs on Few Lines and Few Planes
, 2016 It is well known that any graph admits a crossing-free straight-line drawing in $\mathbb{R}^3$ and that any planar graph admits the same even in $\mathbb{R}^2$. For a graph $G$ and $d \in \{2,3\}$, let $\rho^1_d(G)$ denote the minimum number of lines in $
D Bienstock +17 more
core +1 more source
Ortho-Radial Drawing in Near-Linear Time [PDF]
TheoretiCSAn orthogonal drawing is an embedding of a plane graph into a grid. In a seminal work of Tamassia (SIAM Journal on Computing 1987), a simple combinatorial characterization of angle assignments that can be realized as bend-free orthogonal drawings was ...
Yi-Jun Chang
doaj +1 more source
Drawing a Graph in a Hypercube
, 2004 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.
Wood, David R.
core +2 more sources
Book crossing numbers of the complete graph and small local convex crossing numbers
, 2017 A $ k $-page book drawing of a graph $ G $ is a drawing of $ G $ on $ k $ halfplanes with common boundary $ l $, a line, where the vertices are on $ l $ and the edges cannot cross $ l $. The $ k $-page book crossing number of the graph $ G $, denoted by $
Dandurand, Julia +4 more
core
Homomorphic Preimages of Geometric Cycles
, 2015 A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H.
Cockburn, Sally
core