Open access
Sep 2026
Improved Exact Algorithm for Finding a Maximum Exploratory Equivalent Partition
An exploratory equivalent partition (EE partition) of a graph G with nontrivial automorphisms is a partition of its vertex set that can be directly translated into a set of constraints to speed up the search for occurrences of G in an arbitrary host graph. The maximum EE partition problem is to find an EE partition lea...
Lovro Sikošek, Uroš Čibej, J. Mihelič et al.
· Symmetry · 0 citations