Results 61 to 70 of about 424,447 (182)
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
A layout framework for genome-wide multiple sequence alignment graphs
Frontiers in BioinformaticsSequence alignments are often used to analyze genomic data. However, such alignments are often only calculated and compared on small sequence intervals for analysis purposes.
Jeremias Schebera +3 more
doaj +1 more source
Orthogonal Graph Drawing with Inflexible Edges
, 2015 We consider the problem of creating plane orthogonal drawings of 4-planar graphs (planar graphs with maximum degree 4) with constraints on the number of bends per edge.
Bläsius, Thomas +2 more
core +1 more source
Simultaneous Orthogonal Planarity
, 2016 We introduce and study the $\textit{OrthoSEFE}-k$ problem: Given $k$ planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there an assignment of the vertices to grid points and of the edges to paths on
A Estrella-Balderrama +24 more
core +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
Straight-line Drawability of a Planar Graph Plus an Edge
, 2015 We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing.
C Gutwenger +8 more
core +1 more source
Frequent Graph Discovery: Application to Line Drawing Document Images
ELCVIA Electronic Letters on Computer Vision and Image Analysis, 2005 In this paper a sequence of steps is applied to a graph representation of line drawings using concepts from data mining. This process finds frequent subgraphs and then association rules between these subgraphs.
Eugen Barbu +3 more
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
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
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
, 2017 We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting one additional type of edge segments (circular arcs and diagonal segments,
A Garg +29 more
core +1 more source