Results 1 to 10 of about 11,183,836 (302)
Analogies between the Crossing Number and the Tangle Crossing Number [PDF]
The Electronic Journal of Combinatorics, 2018 Tanglegrams are special graphs that consist of a pair of rooted binary trees with the same number of leaves, and a perfect matching between the two leaf-sets. These objects are of use in phylogenetics and are represented with straight-line drawings where the leaves of the two plane binary trees are on two parallel lines and only the matching edges can ...
Robin Anderson +10 more
openaire +6 more sources
Triple crossing number and double crossing braid index [PDF]
Journal of Knot Theory and Its Ramifications, 2019 Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A triple crossing is a crossing where three strands meet at a single point, such that each strand bisects the crossing. In this paper we find a relationship between the triple crossing number and the double crossing braid index for
Daishiro Nishida
openaire +5 more sources
Improvement on the Crossing Number of Crossing-Critical Graphs [PDF]
Discrete & Computational Geometry, 2020 AbstractThe crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. A graph G is k-crossing-critical if its crossing number is at least k, but if we remove any edge of G, its crossing number drops below k.
János Barát, Géza Tóth
openaire +7 more sources
Approximating the rectilinear crossing number [PDF]
Computational Geometry, 2016 A straight-line drawing of a graph $G$ is a mapping which assigns to each vertex a point in the plane and to each edge a straight-line segment connecting the corresponding two points. The rectilinear crossing number of a graph $G$, $\overline{cr}(G)$, is the minimum number of crossing edges in any straight-line drawing of $G$. Determining or estimating
Fox, Jacob, Pach, János, Suk, Andrew
openaire +6 more sources
The Bundled Crossing Number [PDF]
International Symposium Graph Drawing and Network Visualization, 2016 Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016)
Alam, M. J., Fink, M., Pupyrev, S.
openaire +4 more sources
Monotone Crossing Number [PDF]
International Symposium Graph Drawing and Network Visualization, 2012 The monotone crossing number of G is defined as the smallest number of crossing points in a drawing of G in the plane, where every edge is represented by an x-monotone curve, that is, by a connected continuous arc with the property that every vertical line intersects it in at most one point.
János Pach, Géza Tóth
openaire +2 more sources
On the Degenerate Crossing Number [PDF]
Discrete & Computational Geometry, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ackerman, Eyal, Pinchasi, Rom
openaire +3 more sources
Implementation of Minutiae Based Fingerprint Identification System Using Crossing Number Concept [PDF]
Informatică economică, 2014 Biometric system is essentially a pattern recognition system which recognizes a person by determining the authenticity of a specific physiological (e.g., fingerprints, face, retina, iris) or behavioral (e.g., gait, signature) characteristic possessed by ...
Atul S. CHAUDHARI +2 more
doaj +2 more sources
Towards Better Approximation of Graph Crossing Number [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2020 Graph Crossing Number is a fundamental and extensively studied problem with wide ranging applications. In this problem, the goal is to draw an input graph $G$ in the plane so as to minimize the number of crossings between the images of its edges.
Julia Chuzhoy, S. Mahabadi, Zihan Tan
semanticscholar +1 more source
Counting Hamiltonian Cycles in 2-Tiled Graphs
Mathematics, 2021 In 1930, Kuratowski showed that K3,3 and K5 are the only two minor-minimal nonplanar graphs. Robertson and Seymour extended finiteness of the set of forbidden minors for any surface.
Alen Vegi Kalamar +2 more
doaj +1 more source