A constrained power method for community detection in complex networks

DOI10.1155/2014/804381zbMath1407.91203OpenAlexW1978252694WikidataQ59069377 ScholiaQ59069377MaRDI QIDQ1719174

Wenye Li

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/804381

Mathematics Subject Classification ID

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

Uses Software

• GraphBase

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modularity-maximizing graph communities via mathematical programming
• Revealing network communities with a nonlinear programming method
• From the Cover: The structure of scientific collaboration networks
• Community structure in social and biological networks
• Collective dynamics of ‘small-world’ networks
• Multilevel local search algorithms for modularity clustering
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Networks

This page was built for publication: A constrained power method for community detection in complex networks