A framework of mapping undirected to directed graphs for community detection
From MaRDI portal
Publication:528677
DOI10.1016/J.INS.2014.10.069zbMATH Open1360.05163OpenAlexW2087467283MaRDI QIDQ528677FDOQ528677
Publication date: 16 May 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.10.069
Directed graphs (digraphs), tournaments (05C20) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- Community structure in social and biological networks
- Exploring complex networks
- Overlapping community detection in networks
- Identification of overlapping and non-overlapping community structure by fuzzy clustering in complex networks
- Enhancing community detection using a network weighting strategy
- Community detection in networks via a spectral heuristic based on the clustering coefficient
- Revealing network communities with a nonlinear programming method
- Anti-modularity and anti-community detecting in complex networks
Cited In (4)
This page was built for publication: A framework of mapping undirected to directed graphs for community detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528677)