Por favor, use este identificador para citar o enlazar este ítem:
http://infotec.repositorioinstitucional.mx/jspui/handle/1027/435| An ongoing project to improve the rectilinear and the pseudolinear crossing constants | |
| Oswin Aichholzer Frank Duque RUY FABILA MONROY OSCAR EDUARDO GARCIA QUINTERO Carlos Hidalgo_Toscano | |
| Acceso Abierto | |
| Atribución-NoComercial-SinDerivadas | |
| http://jgaa.info/accepted/2020/540.pdf DOI: 10.7155/jgaa.00540 | |
| Algorithms Graphs Mathematics and statistics | |
| A drawing of a graph in the plane is 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 these curves crosses precisely once. A special case is rectilinear drawings where the edges of the graph are drawn as straight line segments. The rectilinear (pseudolinear) crossing number of a graph is the minimum number of pairs of edges of the graph that cross in any of its rectilinear (pseudolinear) drawings. In this paper we describe an ongoing project to continuously obtain better asymptotic upper bounds on the rectilinear and pseudolinear crossing number of the complete graph Kn. | |
| Journal of Graph Algorithms and Applications | |
| 2020-07 | |
| Artículo | |
| Journal of Graph Algorithms and Applications, volume 24, issue 3 | |
| Inglés | |
| Aichholzer, O., Duque F., Fabila Monroy, R., García Quintero, O. E., Hidalgo Toscano, C., 2020. An ongoing project to improve the rectilinear and the pseudolinear crossing constants. Journal of Graph Algorithms and Applications, vol. 24, no. 3, pp. 421–432. DOI: 10.7155/jgaa.00540 | |
| OTRAS ESPECIALIDADES MATEMÁTICAS | |
| Versión publicada | |
| publishedVersion - Versión publicada | |
| Aparece en las colecciones: | Artículos |
Cargar archivos:
| Fichero | Tamaño | Formato | |
|---|---|---|---|
| OA_An Ongoing_2020.pdf | 411.48 kB | Adobe PDF | Visualizar/Abrir |