Results 41 to 50 of about 2,072,739 (293)
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.
BAYKASOGLU +32 more
core +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
A Simple Method for Network Visualization
Mathematics, 2020 In this article, we present a simple method for network visualization. The proposed method is based on distmesh [P.O. Persson and G. Strang, A simple mesh generator in MATLAB, SIAM Review 46 (2004) pp.
Jintae Park +3 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
Coloring Drawings of Graphs [PDF]
The Electronic Journal of Combinatorics, 2022 We consider cell colorings of drawings of graphs in the plane. Given a multi-graph $G$ together with a drawing $\Gamma(G)$ in the plane with only finitely many crossings, we define a cell $k$-coloring of $\Gamma(G)$ to be a coloring of the maximal connected regions of the drawing, the cells, with $k$ colors such that adjacent cells have different ...
Hertrich, Christoph +2 more
openaire +2 more sources
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
Mental-Map Preserving Visualisation of Partitioned Networks in Vanted
Journal of Integrative Bioinformatics, 2019 Biological networks can be large and complex, often consisting of different sub-networks or parts. Separation of networks into parts, network partitioning and layouts of overview and sub-graphs are of importance for understandable visualisations of those
Garkov Dimitar +3 more
doaj +1 more source
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings [PDF]
, 2014 Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations.
A.C. Yao +10 more
core +4 more sources
The Complexity of Drawing a Graph in a Polygonal Region [PDF]
International Symposium Graph Drawing and Network Visualization, 2018 We prove that the following problem is complete for the existential theory of the reals: Given a planar graph and a polygonal region, with some vertices of the graph assigned to points on the boundary of the region, place the remaining vertices to create
A. Lubiw +2 more
semanticscholar +1 more source
Experimental Evaluation of Book Drawing Algorithms
, 2017 A $k$-page book drawing of a graph $G=(V,E)$ consists of a linear ordering of its vertices along a spine and an assignment of each edge to one of the $k$ pages, which are half-planes bounded by the spine. In a book drawing, two edges cross if and only if
Klawitter, Jonathan +2 more
core +2 more sources