Zobrazeno 1 - 10
of 180
pro vyhledávání: '"Márquez, Alberto"'
For a convex body $C$ in $\mathbb{R}^d$ and a division of $C$ into convex subsets $C_1,\ldots,C_n$, we can consider $max\{F(C_1),\ldots, F(C_n)\}$ (respectively, $min\{F(C_1),\ldots, F(C_n)\}$), where $F$ represents one of these classical geometric m
Externí odkaz:
http://arxiv.org/abs/2311.13882
Publikováno v:
In Physiology & Behavior 1 January 2025 288
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to capture natur
Externí odkaz:
http://arxiv.org/abs/2201.12650
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter provides a natural measu
Externí odkaz:
http://arxiv.org/abs/2103.11676
Autor:
Ripoll, Juan G. *, Warner, Matthew A. *, Hanson, Andrew C., Marquez, Alberto *, Dearani, Joseph A., Nuttall, Gregory A. *, Kor, Daryl J. *, Mauermann, William J. *, Smith, Mark. M. *
Publikováno v:
In Journal of Cardiothoracic and Vascular Anesthesia June 2023 37(6):933-941
We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received considerable attention recently, mo
Externí odkaz:
http://arxiv.org/abs/1807.10093
Autor:
Gómez-Gálvez, Pedro, Vicente-Munuera, Pablo, Anbari, Samira, Tagua, Antonio, Gordillo-Vázquez, Carmen, Andrés-San Román, Jesús A., Franco-Barranco, Daniel, Palacios, Ana M., Velasco, Antonio, Capitán-Agudo, Carlos, Grima, Clara, Annese, Valentina, Arganda-Carreras, Ignacio, Robles, Rafael, Márquez, Alberto, Buceta, Javier, Escudero, Luis M.
Publikováno v:
In Cell Systems 17 August 2022 13(8):631-643
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Cáceres, José, Garijo, Delia, González, Antonio, Márquez, Alberto, Puertas, María Luz, Ribeiro, Paula
We study the problem of augmenting the locus $\mathcal{N}_{\ell}$ of a plane Euclidean network $\mathcal{N}$ by inserting iteratively a finite set of segments, called \emph{shortcut set}, while reducing the diameter of the locus of the resulting netw
Externí odkaz:
http://arxiv.org/abs/1604.03878