Perfect Sampling of graph k-colorings for k>3Δ.
Siddharth BhandariSayantan ChakrabortyPublished in: CoRR (2019)
Keyphrases
- graph theory
- directed graph
- graph structure
- random walk
- weighted graph
- graph based algorithm
- frequent subgraph mining
- structured data
- random sampling
- directed acyclic graph
- graph model
- monte carlo
- graph databases
- undirected graph
- graph theoretic
- graph data
- sampling strategy
- dependency graph
- stable set
- genetic algorithm