AI Chat AI Image Generator AI Video Text to Speech

How to sample connected K-partitions of a graph

07/21/2018

∙

by Marina Meila, et al.

∙

∙

A connected undirected graph G=(V,E) is given. This paper presents an algorithm that samples (non-uniformly) a K partition U_1,... 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 C_K of all such partitions is obtained in closed form.

page 1

page 2

page 3

research

∙ 11/14/2020

Reconfiguration of Connected Graph Partitions via Recombination

Motivated by applications in gerrymandering detection, we study a reconf...

0 Hugo A. Akitaya, et al. ∙

research

∙ 06/29/2018

Comparing Graph Clusterings: Set partition measures vs. Graph-aware measures

In this paper, we propose a family of graph partition similarity measure...

0 Valérie Poulin, et al. ∙

research

∙ 04/06/2018

Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams

Partitioning a graph into balanced components is important for several a...

0 Yu Nakahata, et al. ∙

research

∙ 10/10/2018

Algorithm for B-partitions, parameterized complexity of the matrix determinant and permanent

Every square matrix A=(a_uv)∈C^n× n can be represented as a digraph havi...

0 Ranveer Singh, et al. ∙

research

∙ 08/19/2020

Inheritance of Convexity for the 𝒫̃_min-Restricted Game

We consider a restricted game on weighted graphs associated with minimum...

0 Alexandre Skoda, et al. ∙

research

∙ 07/22/2021

Fourier-Reflexive Partitions Induced by Poset Metric

Let 𝐇 be the cartesian product of a family of finite abelian groups inde...

0 Yang Xu, et al. ∙

research

∙ 12/10/2020

Building Graphs at a Large Scale: Union Find Shuffle

Large scale graph processing using distributed computing frameworks is b...

0 Saigopal Thota, et al. ∙