Defining and identifying cograph communities in complex networks

DOI10.1088/1367-2630/17/1/013044zbMath1452.05171OpenAlexW2005989548MaRDI QIDQ3387608

Yong Gao, Songwei Jia, James Nastos, Haiyang Wang, Xindong Zhang, Yijie Wang, Lin Gao

Publication date: 13 January 2021

Published in: New Journal of Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1367-2630/17/1/013044

zbMATH Keywords

complex networkscentralitycommunity dection

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

On the effectiveness of the incremental approach to minimal chordal edge modification ⋮ The micro-world of cographs ⋮ Linear-time minimal cograph editing ⋮ Faster and enhanced inclusion-minimal cograph completion ⋮ A multivariate analysis of the strict terminal connection problem

Uses Software

• igraph
• clusterSim
• NMF MATLAB Toolbox

Cites Work

• Unnamed Item
• The cluster deletion problem for cographs
• Complexity and parameterized algorithms for cograph editing
• Complement reducible graphs
• A simple linear time algorithm for cograph recognition
• Orthology relations, symbolic ultrametrics, and cographs
• BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES
• A Simple Linear Time LexBFS Cograph Recognition Algorithm
• Community structure in social and biological networks
• Finding overlapping communities in networks by label propagation
• Fast unfolding of communities in large networks
• Learning the parts of objects by non-negative matrix factorization

This page was built for publication: Defining and identifying cograph communities in complex networks