Perfectly Sampling k≥ (8/3 +o(1))Δ-Colorings in Graphs.

Vishesh Jain Ashwin Sah Mehtaab Sawhney

Published in: CoRR (2020)

Keyphrases

graph matching
graph theory
graph theoretic
uniform random
data sets
sampling algorithm
bipartite graph
parameter space
monte carlo
directed graph
random sampling
weighted graph
sample size
particle filter
sampling methods
sampling strategy
subgraph isomorphism
sampling strategies
pairwise