TY  - JOUR
A1  - Angeleska, Angela
A1  - Omranian, Sara
A1  - Nikoloski, Zoran
T1  - Coherent network partitions
BT  - Characterizations with cographs and prime graphs
JF  - Theoretical computer science : the journal of the EATCS
N2  - We continue to study coherent partitions of graphs whereby the vertex set is partitioned into subsets that induce biclique spanned subgraphs. The problem of identifying the minimum number of edges to obtain biclique spanned connected components (CNP), called the coherence number, is NP-hard even on bipartite graphs. Here, we propose a graph transformation geared towards obtaining an O (log n)-approximation algorithm for the CNP on a bipartite graph with n vertices. The transformation is inspired by a new characterization of biclique spanned subgraphs. In addition, we study coherent partitions on prime graphs, and show that finding coherent partitions reduces to the problem of finding coherent partitions in a prime graph. Therefore, these results provide future directions for approximation algorithms for the coherence number of a given graph.
KW  - Graph partitions
KW  - Network clustering
KW  - Cographs
KW  - Coherent partition
KW  - Prime graphs
Y1  - 2021
U6  - https://doi.org/10.1016/j.tcs.2021.10.002
SN  - 0304-3975
VL  - 894
SP  - 3
EP  - 11
PB  - Elsevier
CY  - Amsterdam [u.a.]
ER  -