Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Caro, Christopher Thraves"'
In this work, we extend the concept of Robinson spaces to asymmetric dissimilarities, enhancing their applicability in representing and analyzing complex data. Within this generalized framework, we introduce two different problems that extend the cla
Externí odkaz:
http://arxiv.org/abs/2412.04118
Autor:
Arrepol, Francisco, Asenjo, Patricio, Astete, Raúl, Cartes, Víctor, Gajardo, Anahí, Henríquez, Valeria, Opazo, Catalina, Sanhueza-Matamala, Nicolás, Caro, Christopher Thraves
For a graph $G$, an edge-separating (resp. vertex-separating) path system of $G$ is a family of paths in $G$ such that for any pair of edges $e_1, e_2$ (resp. pair of vertices $v_1, v_2$) of $G$ there is at least one path in the family that contains
Externí odkaz:
http://arxiv.org/abs/2306.00843
The immersion-analogue of Hadwiger's Conjecture states that every graph $G$ contains an immersion of $K_{\chi(G)}$. This conjecture has been recently strengthened in the following way: every graph $G$ contains a totally odd immersion of $K_{\chi(G)}$
Externí odkaz:
http://arxiv.org/abs/2305.07752
A matrix is incomplete when some of its entries are missing. A Robinson incomplete symmetric matrix is an incomplete symmetric matrix whose non-missing entries do not decrease along rows and columns when moving toward the diagonal. A Strong-Robinson
Externí odkaz:
http://arxiv.org/abs/2101.03033
A metric space $\mathcal{T}$ is a \emph{real tree} if for any pair of points $x, y \in \mathcal{T}$ all topological embeddings $\sigma$ of the segment $[0,1]$ into $\mathcal{T}$, such that $\sigma (0)=x$ and $\sigma (1)=y$, have the same image (which
Externí odkaz:
http://arxiv.org/abs/1911.11494
In this work, we consider a computational model of a distributed system formed by a set of servers in which jobs, that are continuously arriving, have to be executed. Every job is formed by a set of dependent tasks (i.~e., each task may have to wait
Externí odkaz:
http://arxiv.org/abs/1910.01869
The weighted \emph{Sitting Closer to Friends than Enemies} (SCFE) problem is to find an injection of the vertex set of a given weighted graph into a given metric space so that, for every pair of incident edges with different weight, the end vertices
Externí odkaz:
http://arxiv.org/abs/1906.11812
The randomized rumor spreading problem generates a big interest in the area of distributed algorithms due to its simplicity, robustness and wide range of applications. The two most popular communication paradigms used for spreading the rumor are Push
Externí odkaz:
http://arxiv.org/abs/1812.11903
The Sitting Closer to Friends than Enemies (SCFE) problem is to find an embedding in a metric space for the vertices of a given signed graph so that, for every pair of incident edges with different sign, the positive edge is shorter (in the metric of
Externí odkaz:
http://arxiv.org/abs/1811.02699
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.