Coherent network partitions

DOI10.1016/j.dam.2019.02.048zbMath1464.05302OpenAlexW2924593256MaRDI QIDQ2026346

Angela Angeleska, Zoran Nikoloski

Publication date: 19 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.02.048

zbMATH Keywords

graph partitionsnetwork clusteringcoherence numbercoherent partition

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

CUBCO: Prediction of Protein Complexes Based on Min-cut Network Partitioning into Biclique Spanned Subgraphs ⋮ Coherent network partitions: characterizations with cographs and prime graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Biclique covers and partitions
• Graph clustering
• The clique-partitioning problem
• Covering graphs with few complete bipartite subgraphs
• A graph and its complement with specified properties. I: Connectivity
• The maximum edge biclique problem is NP-complete
• Generalizations of matched CNF formulas
• On clique covers and independence numbers of graphs
• The computational complexity of disconnected cut and \(2 K_2\)-partition
• On biclique coverings
• Reducibility among Combinatorial Problems
• Density-Constrained Graph Clustering

This page was built for publication: Coherent network partitions