Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
0 answers
56 views

Using graph symmetries to speed up subgraph enumeration

I have an undirected graph $G$. It has some symmetries in the sense that I know it's automorphism group $\text{Aut}(G)$. I am searching for a specific subgraph defined by some constraints $\phi$ and ...
Jáchym Barvínek's user avatar