4 papers
Long paths need not minimize -colorings among trees
David Galvin, Emily McMillon, JD Nir +1
Given a graph and a target graph , an -coloring of is an adjacency-preserving vertex map from to . By appropriate choice of , these colorings can express, f…
Characterizing Graphs as Algebraic Squares
Karen L. Collins, David Galvin, Christine A. Kelley +2
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphi…
Relational Weight Optimization for Enhancing Team Performance in Multi-Agent Multi-Armed Bandits
Monish Reddy Kotturu, Saniya Vahedian Movahed, Paul Robinette +3
We introduce an approach to improve team performance in a Multi-Agent Multi-Armed Bandit (MAMAB) framework using Fastest Mixing Markov Chain (FMMC) and Fastest Distributed Linear A…
Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd
William K. Moses, Amanda Redlich
In this paper, we look at and expand the problems of dispersion and Byzantine dispersion of mobile robots on a graph, introduced by Augustine and Moses~Jr.~[ICDCN~2018] and by Moll…