Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Duque, Frank"'
Autor:
Duque, Frank
Let $\mathcal{A}$ be a set of straight lines in the plane (or planes in $\mathbb{R}^3$). The $k$-crossing visibility of a point $p$ on $\mathcal{A}$ is the set $Q$ of points in the elements of $\mathcal{A}$ such that the segment $pq$, where $q\in Q$,
Externí odkaz:
http://arxiv.org/abs/2312.02827
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology: a random number, called its fitness, is assigned to each vertex of a graph, then a path in the graph is accessible if fitnesses are strictly increasing t
Externí odkaz:
http://arxiv.org/abs/2206.00657
Autor:
Aichholzer, Oswin, Duque, Frank, Fabila-Monroy, Ruy, Hidalgo-Toscano, Carlos, García-Quintero, Oscar E.
A drawing of a graph in the plane is {\it pseudolinear} if the edges of the drawing can be extended to doubly-infinite curves that form an arrangement of pseudolines, that is, any pair of edges crosses precisely once. A special case are {\it rectilin
Externí odkaz:
http://arxiv.org/abs/1907.07796
A geometric graph is a graph whose vertices are points in general position in the plane and its edges are straight line segments joining these points. In this paper we give an $O(n^2 \log n)$ algorithm to compute the number of pairs of edges that cro
Externí odkaz:
http://arxiv.org/abs/1904.11037
Publikováno v:
In Applied Mathematics and Computation 1 April 2022 418
In this paper we study a variation of the accessibility percolation model, this is also motivated by evolutionary biology and evolutionary computation. Consider a tree whose vertices are labeled with random numbers. We study the probability of having
Externí odkaz:
http://arxiv.org/abs/1712.04548
Autor:
Duque, Frank, González-Aguilar, Hernán, Hernández-Vélez, César, Leaños, Jesús, Medina, Carolina
Publikováno v:
Electron. J. Combin. 25 (2018), no. 2, Paper 2.43, 11 pp
A plane drawing of a graph is {\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoints) any of these circles. The {\em cylindrical crossing number} of a gr
Externí odkaz:
http://arxiv.org/abs/1708.01942
An edge-ordered graph is a graph with a total ordering of its edges. A path $P=v_1v_2\ldots v_k$ in an edge-ordered graph is called increasing if $(v_iv_{i+1}) > (v_{i+1}v_{i+2})$ for all $i = 1,\ldots,k-2$; it is called decreasing if $(v_iv_{i+1}) <
Externí odkaz:
http://arxiv.org/abs/1703.05378
Autor:
Duque, Frank, Fabila-Monroy, Ruy
Let $S$ be a set of $n$ points in general position in the plane. Join every pair of points in $S$ with a straight line segment. Let $\overline{cr}(S)$ be number of pairs of these edges that intersect in their interior. Suppose that this number is kno
Externí odkaz:
http://arxiv.org/abs/1609.00867
In 2001, K\'arolyi, Pach and T\'oth introduced a family of point sets to solve an Erd\H{o}s-Szekeres type problem; which have been used to solve several other Ed\H{o}s-Szekeres type problems. In this paper we refer to these sets as nested almost conv
Externí odkaz:
http://arxiv.org/abs/1606.02328