Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case

by   Markus Anders, et al.

Color refinement is a crucial subroutine in symmetry detection in theory as well as practice. It has further applications in machine learning and in computational problems from linear algebra. While tight lower bounds for the worst case complexity are known [Berkholz, Bonsma, Grohe, ESA2013] no comparative analysis of design choices for color refinement algorithms is available. We devise two models within which we can compare color refinement algorithms using formal methods, an online model and an approximation model. We use these to show that no online algorithm is competitive beyond a logarithmic factor and no algorithm can approximate the optimal color refinement splitting scheme beyond a logarithmic factor. We also directly compare strategies used in practice showing that, on some graphs, queue based strategies outperform stack based ones by a logarithmic factor and vice versa. Similar results hold for strategies based on priority queues.


Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms

We define a search problem on trees that closely captures the backtracki...

Learning-Augmented Algorithms for Online Steiner Tree

This paper considers the recently popular beyond-worst-case algorithm an...

Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths

In this paper, we study the single-source shortest-path (SSSP) problem w...

Color Refinement, Homomorphisms, and Hypergraphs

Recent results show that the structural similarity of graphs can be char...

Variance-reduced Q-learning is minimax optimal

We introduce and analyze a form of variance-reduced Q-learning. For γ-di...

Online Network Utility Maximization: Algorithm, Competitive Analysis, and Applications

We consider an online version of the well-studied network utility maximi...

Efficient Splitting of Measures and Necklaces

We provide approximation algorithms for two problems, known as NECKLACE ...