TY  - JOUR
A1  - Angeleska, Angela
A1  - Nikoloski, Zoran
T1  - Coherent network partitions
T2  - Discrete applied mathematics
N2  - Graph clustering is widely applied in the analysis of cellular networks reconstructed from large-scale data or obtained from experimental evidence. Here we introduce a new type of graph clustering based on the concept of coherent partition. A coherent partition of a graph G is a partition of the vertices of G that yields only disconnected subgraphs in the complement of G. The coherence number of G is then the size of the smallest edge cut inducing a coherent partition. A coherent partition of G is optimal if the size of the inducing edge cut is the coherence number of G. Given a graph G, we study coherent partitions and the coherence number in connection to (bi)clique partitions and the (bi)clique cover number. We show that the problem of finding the coherence number is NP-hard, but is of polynomial time complexity for trees. We also discuss the relation between coherent partitions and prominent graph clustering quality measures.
KW  - Graph partitions
KW  - Network clustering
KW  - Coherence number
KW  - Coherent partition
Y1  - 2019
UR  - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/48475
SN  - 0166-218X
SN  - 1872-6771
VL  - 266
SP  - 283
EP  - 290
PB  - Elsevier
CY  - Amsterdam
ER  -