4 citations · 9 across the 7 of their papers we have counts for
8 papers
Extending Robinson Spaces: Complexity and Algorithmic Solutions for Non-Symmetric Dissimilarity Spaces
Francois Brucker, Pascal Préa, Christopher Thraves Caro
In this work, we extend the concept of Robinson spaces to asymmetric dissimilarities, enhancing their applicability in representing and analyzing complex data. Within this generali…
Totally odd immersions in line graphs
Andrea Jiménez, Daniel A. Quiroz, Christopher Thraves Caro
The immersion-analogue of Hadwiger's Conjecture states that every graph contains an immersion of . This conjecture has been recently strengthened in the following way…
On the Recognition of Strong-Robinsonian Incomplete Matrices
Julio Aracena, Christopher Thraves Caro
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 alon…
System Stability Under Adversarial Injection of Dependent Tasks
Vicent Cholvi, Juan Echagüe, Antonio Fernández Anta +1
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…
Randomized Rumor Spreading in Ad Hoc Networks with Buffers
Dariusz R. Kowalski, Christopher Thraves Caro
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…
Signed graph embedding: when everybody can sit closer to friends than enemies
Anne-Marie Kermarrec, Christopher Thraves
Signed graphs are graphs with signed edges. They are commonly used to represent positive and negative relationships in social networks. While balance theory and clusterizable graph…