Search Results for author: Johann A. Makowsky

Found 1 papers, 0 papers with code

On the exact learnability of graph parameters: The case of partition functions

no code implementations13 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$.

Cannot find the paper you are looking for? You can Submit a new open access paper.