Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

THE MAXIMUM COMMUNITY PARTITION PROBLEM IN NETWORKS

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

DOI10.1142/S1793830913500316zbMath1285.90053MaRDI QIDQ2874043

Weidong Chen, Yuanjun Bi, Zheng Gao, Zaixin Lu, Jiaofei Zhong, Weili Wu

Publication date: 28 January 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)


zbMATH Keywords

\(\mathcal{NP}\)-hardcommunity partition


Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)


Related Items (1)

Social network analysis and applications: A review of the broad research aspects of social network structure



Cites Work

  • A combinatorial model and algorithm for globally searching community structure in complex networks
  • Graph clustering
  • On clusterings
  • Community structure in social and biological networks
  • Unnamed Item


This page was built for publication: THE MAXIMUM COMMUNITY PARTITION PROBLEM IN NETWORKS

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2874043&oldid=15817991"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki