2 papers
cs.DS2026
Multiplication of 0-1 matrices via clustering
Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas +1
We study applications of clustering (in particular, the -center clustering problem) in the design of efficient and practical algorithms for computing an approximate and the exac…
math.CO2026
Burning Graph Powers and Branching Trees
Jesper Jansson, Shashanka Kulamarva, Yukihiro Murakami +1
Graph burning is a discrete-time process that models the spread of social contagion. Initially, all vertices are unburned. In each round, one unburned vertex is selected and burned…