Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A density set algorithm for searching communities in complex networks

From MaRDI portal
Publication:2916705
Jump to:navigation, search

zbMATH Open1265.91137MaRDI QIDQ2916705FDOQ2916705

Fuding Xie, Yong Zhang, Yan Sun, Dan Huang, Dawei Zhang

Publication date: 5 October 2012

Published in: Journal of University of Electronic Science and Technology of China (Search for Journal in Brave)





Recommendations

  • Detecting network communities: a new systematic and efficient algorithm
  • Finding network communities using modularity density
  • Finding community structure in networks using a shortest-path-based \(k\)-means algorithm
  • Formalising and detecting community structures in real world complex networks
  • An algorithm J-SC of detecting communities in complex networks


zbMATH Keywords

complex networkcommunitydensity set


Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)



Cited In (3)

  • A DC Programming Approach for Finding Communities in Networks
  • The k-Dense Method to Extract Communities from Complex Networks
  • Title not available (Why is that?)





This page was built for publication: A density set algorithm for searching communities in complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2916705)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2916705&oldid=15886021"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 20:13. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki