Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time

Talya Eden, Reut Levi, Dana Ron +1

Counting small subgraphs, referred to as motifs, in large graphs is a fundamental task in graph analysis, extensively studied across various contexts and computational models. In t…