Algorithms to approximately count and sample conforming colorings of graphs.

Sarah Miracle Dana Randall

Published in: Discret. Appl. Math. (2016)

Keyphrases

orders of magnitude
computational cost
computationally efficient
graph theory
times faster
neural network
data structure
graph data
learning algorithm
significant improvement
optimization problems
bipartite graph
random graphs