2 papers
cs.DS2025
Spectral partitioning of graphs into compact, connected regions
Ewan Davies, Ryan Job, Maxine Kampbell +2
We define and study a spectral recombination algorithm, SpecReCom, for partitioning a graph into a given number of connected parts. It is straightforward to introduce additional co…
cs.PL2024
Simplification of Polyhedral Reductions in Practice
Louis Narmour, Ryan Job, Tomofumi Yuki +1
Reductions combine collections of inputs with an associative (and here, also commutative) operator to produce collections of outputs. When the same value contributes to multiple ou…