Defining and identifying cograph communities in complex networks
From MaRDI portal
Recommendations
Cites work
- A simple linear time algorithm for cograph recognition
- A Simple Linear Time LexBFS Cograph Recognition Algorithm
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Community structure in social and biological networks
- Complement reducible graphs
- Complexity and parameterized algorithms for cograph editing
- Fast unfolding of communities in large networks
- Finding overlapping communities in networks by label propagation
- scientific article; zbMATH DE number 51785 (Why is no real title available?)
- Learning the parts of objects by non-negative matrix factorization
- Orthology relations, symbolic ultrametrics, and cographs
- The cluster deletion problem for cographs
Cited in
(5)
This page was built for publication: Defining and identifying cograph communities in complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387608)