How to sample connected $K$partitions of a graph
Abstract
A connected undirected graph $G=(V,E)$ is given. This paper presents an algorithm that samples (nonuniformly) a $K$ partition $U_1,\ldots U_K$ of the graph nodes $V$, such that the subgraph induced by each $U_k$, with $k=1:K$, is connected. Moreover, the probability induced by the algorithm over the set ${\mathcal C}_K$ of all such partitions is obtained in closed form.
 Publication:

arXiv eprints
 Pub Date:
 July 2018
 DOI:
 10.48550/arXiv.1808.00050
 arXiv:
 arXiv:1808.00050
 Bibcode:
 2018arXiv180800050M
 Keywords:

 Computer Science  Discrete Mathematics;
 Mathematics  Combinatorics
 EPrint:
 3 pages