Exploració per autor "Flores Peñaloza, David"
Ara es mostren els items 5-7 de 7
-
On maximum-sum matchings of points
Bereg, Sergey; Chacón Rivera, Oscar; Flores Peñaloza, David; Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos (Springer Nature, 2022-06-21)
Article
Accés obertHuemer et al. (Discrete Mathematics, 2019) proved that for any two point sets R and B with |R|=|B| , the perfect matching that matches points of R with points of B, and maximizes the total squared Euclidean distance of the ... -
On maximum-sum matchings of points
Bereg, Sergey; Chacón Rivera, Oscar; Flores Peñaloza, David; Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos (2021)
Text en actes de congrés
Accés restringit per política de l'editorialHuemer et al. (Discrete Math., 2019) proved that for any two point sets R and B with |R| = |B|, the perfect matching that matches points of R with points of B, and maximizes the total squared Euclidean distance of the ... -
Proximity graphs inside large weighted graphs
Ábrego, Bernardo M.; Fabila Monroy, Ruy; Fernández-Merchant, Silvia; Flores Peñaloza, David; Hurtado Díaz, Fernando Alfredo; Meijer, Henk; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria (2010)
Text en actes de congrés
Accés obertGiven a large weighted graph G = (V;E) and a subset U of V , we de¯ne several graphs with vertex set U in which two vertices are adjacent if they satisfy some prescribed proximity rule. These rules use the shortest path ...