Results 31 to 40 of about 46,383 (144)
Various heuristic algorithms to minimise the two-page crossing numbers of graphs
Open Computer Science, 2015 We propose several new heuristics for the twopage book crossing problem, which are based on recent algorithms for the corresponding one-page problem. Especially, the neural network model for edge allocation is combined for the first time with various one-
He Hongmei +3 more
doaj +1 more source
Experiments and a User Study for Hierarchical Drawings of Graphs
IEEE Access, 2023 We present a detailed hierarchical graph drawing technique that is based on the Path Based Framework (PBF). Extensive edge bundling is applied to draw all edges of the graph and the height of the drawing is minimized using compaction.
Panagiotis Lionakis +2 more
doaj +1 more source
Mental Map-Preserving Visualization through a Genetic Algorithm
Applied Sciences, 2021 The video game industry has evolved significantly, with different genres becoming popular over time, but how to visualize such information by curating data into a form that makes it easier to identify and understand the trends is quite an interesting ...
Mojiborrahman Dehvari +2 more
doaj +1 more source
The Widths of Strict Outerconfluent Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceStrict outerconfluent drawing is a style of graph drawing in which vertices are drawn on the boundary of a disk, adjacencies are indicated by the existence of smooth curves through a system of tracks within the disk, and no two adjacent vertices are ...
David Eppstein
doaj +1 more source
Numerical integration methods and layout improvements in the context of dynamic RNA visualization
BMC Bioinformatics, 2017 Background RNA visualization software tools have traditionally presented a static visualization of RNA molecules with limited ability for users to interact with the resulting image once it is complete. Only a few tools allowed for dynamic structures. One
Boris Shabash, Kay C. Wiese
doaj +1 more source
On some properties of doughnut graphs
AKCE International Journal of Graphs and Combinatorics, 2016 The class of doughnut graphs is a subclass of 5-connected planar graphs. It is known that a doughnut graph admits a straight-line grid drawing with linear area, the outerplanarity of a doughnut graph is 3, and a doughnut graph is k-partitionable. In this
Md. Rezaul Karim +2 more
doaj +1 more source
More Compact Orthogonal Drawings by Allowing Additional Bends †
Information, 2018 Compacting orthogonal drawings is a challenging task. Usually, algorithms try to compute drawings with small area or total edge length while preserving the underlying orthogonal shape. We suggest a moderate relaxation of the orthogonal compaction problem,
Michael Jünger +2 more
doaj +1 more source
ALTERNATIVE PROOF ON THE CROSSING NUMBER OF K1,1,3,N [PDF]
Acta Electrotechnica et Informatica, 2019 The main aim of the paper is to give the crossing number of join product G+Dn for the connected graph G of order five isomorphic with the complete tripartite graph K1,1,3, where Dn consists on n isolated vertices.
Michal STAS
doaj +1 more source
Gong-kuang zidonghua, 2012 In view of problem of limitation on description and drawing of 3D graph by SVG, the paper proposed a 3D implementing method of SVG. It introduced conversion principle of 2D coordinate to 3D coordinate of SVG in details, gave processes of drawing and ...
WANG Li-li
doaj
GPU-Based Parallel Particle Swarm Optimization Methods for Graph Drawing
Discrete Dynamics in Nature and Society, 2017 Particle Swarm Optimization (PSO) is a population-based stochastic search technique for solving optimization problems, which has been proven to be effective in a wide range of applications. However, the computational efficiency on large-scale problems is
Jianhua Qu +3 more
doaj +1 more source