Login / Signup
Counting and sampling minimum cuts in genus g graphs.
Erin W. Chambers
Kyle Fox
Amir Nayyeri
Published in:
SoCG (2013)
Keyphrases
</>
graph matching
spanning tree
uniform random
graph theory
random sampling
graph partitioning
monte carlo
connected dominating set
square error
graph theoretic
graph mining
undirected graph
graph databases
random graphs
sampling strategy
subgraph isomorphism
parameter space
neural network