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

Nadia Labai Johann A. Makowsky

Published in: CoRR (2016)

Keyphrases

graph representation
partitioning algorithm
graph theoretic
parameter estimation
parameter values
graph theory
graph model
vertex set
structured data
min cut
learning rate
finite automata
spanning tree
uniform distribution
maximum likelihood
boolean functions
connected components
random walk
sufficient conditions