On uniform sampling of cliques
The problem that we are addressing in this thesis is the problem of sampling uniformly the cliques of a target size k of any given graph. As a natural approach for solving this problem, we used the already available state-of-the-art heuristic MAX-CLIQUE solvers. The heuristic MAX-CLIQUE algorithms,...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
University of British Columbia
2009
|
| Online Access: | http://hdl.handle.net/2429/13923 |