The k-Dense Method to Extract Communities from Complex Networks

DOI10.1007/978-3-540-88067-7_14zbMath1171.68440OpenAlexW1517695644MaRDI QIDQ3627917

Kazumi Saito, Takeshi Yamada, Kazuhiro Kazama

Publication date: 13 May 2009

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88067-7_14

zbMATH Keywords

\(k\)-dense communities\(k\)-dense method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cites Work

• Unnamed Item
• An exact algorithm for the maximum clique problem
• An algorithm for drawing general undirected graphs
• Network analysis. Methodological foundations.
• Fast algorithms for determining (generalized) core groups in social networks
• A New Algorithm for Generating All the Maximal Independent Sets
• The Structure and Function of Complex Networks
• Community structure in social and biological networks

This page was built for publication: The k-Dense Method to Extract Communities from Complex Networks