Finding attribute diversified community over large attributed networks
- 17 July 2021
- journal article
- research article
- Published by Springer Nature in World Wide Web
- Vol. 25 (2) , 569-607
Abstract
No abstract availableKeywords
Funding Information
- ARC (DP170104747)
- ARC (DP200103700)
This publication has 45 references indexed in Scilit:
- Dense community detection in multi-valued attributed networksInformation Sciences, 2015
- A model-based approach to attributed graph clustering2012
- Finding maximal k-edge-connected subgraphs from a large graph2012
- Community detection in graphsPhysics Reports, 2010
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time2010
- Enumerating all connected maximal common subgraphs in two graphsTheoretical Computer Science, 2001
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- The minimum augmentation of any graph to a K‐edge‐connected graphNetworks, 1989
- Network structure and minimum degreeSocial Networks, 1983
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973