no code implementations • 13 Jun 2016 • Nadia Labai, Johann A. Makowsky
We study the exact learnability of real valued graph parameters $f$ which are known to be representable as partition functions which count the number of weighted homomorphisms into a graph $H$ with vertex weights $\alpha$ and edge weights $\beta$.