On the public citation graph
A Flexible Divisive Algorithm for Overlapping Community Detection Based on Community Structure
0 signed · 30 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/wics.1319openalex-extracted
Community detection in large‐scale networks: a survey and empirical evaluation
inferredcites →https://doi.org/10.1007/978-3-030-19823-7_42openalex-extracted
Distributed Community Prediction for Social Graphs Based on Louvain Algorithm
inferredcites →https://doi.org/10.1007/978-3-540-74976-9_12openalex-extracted
An Algorithm to Find Overlapping Community Structure in Networks
inferredcites →https://doi.org/10.1016/j.chaos.2020.110101openalex-extracted
Epidemic spreading of evolving community structure
inferredcites →https://doi.org/10.1016/j.dajour.2023.100362openalex-extracted
A community detection model using node embedding approach and graph convolutional network with clustering technique
inferredcites →https://doi.org/10.1016/j.dam.2013.09.017openalex-extracted
Community detection in networks via a spectral heuristic based on the clustering coefficient
inferredcites →https://doi.org/10.1016/j.diin.2015.08.002openalex-extracted
Using shortest path to discover criminal community
inferredcites →https://doi.org/10.1016/j.disopt.2018.07.003openalex-extracted
The vertex k -cut problem
inferredcites →https://doi.org/10.1016/j.hcc.2023.100134openalex-extracted
DPTP-LICD: A differential privacy trajectory protection method based on latent interest community detection
inferredcites →https://doi.org/10.1016/j.ins.2023.02.090openalex-extracted
Large-scale community detection based on core node and layer-by-layer label propagation
inferredcites →https://doi.org/10.1016/j.ins.2024.120164openalex-extracted
Community detection in decentralized social networks with local differential privacy
inferredcites →https://doi.org/10.1016/j.ins.2024.120271openalex-extracted
A hierarchical overlapping community detection method based on closed trail distance and maximal cliques
inferredcites →https://doi.org/10.1016/j.ins.2024.120696openalex-extracted
Leveraging cascading information for community detection in social networks
inferredcites →https://doi.org/10.1016/j.ins.2024.120809openalex-extracted
Adaptive opinion evolution process with opinion dynamics for large-scale group decision making: A novel approach based on overlapping community detection in social networks
inferredcites →https://doi.org/10.1016/j.neucom.2022.06.090openalex-extracted
Doubly stochastic scaling unifies community detection
inferredcites →https://doi.org/10.1016/j.osnem.2022.100219openalex-extracted
A novel attributed community detection by integration of feature weighting and node centrality
inferredcites →https://doi.org/10.1016/j.physa.2019.122717openalex-extracted
A two-stage BFS local community detection algorithm based on node transfer similarity and Local Clustering Coefficient
inferredcites →https://doi.org/10.1016/j.physa.2021.125916openalex-extracted
Computational models for commercial advertisements in social networks
inferredcites →https://doi.org/10.1016/j.procs.2016.06.082openalex-extracted
An Analysis of Overlapping Community Detection Algorithms in Social Networks
inferredcites →https://doi.org/10.1016/j.procs.2022.03.046openalex-extracted
A Systematic Analysis of Community Detection in Complex Networks
inferredcites →https://doi.org/10.1016/j.sasc.2022.200044openalex-extracted
Local Intrinsic Density Based Community Detection Using Branch-and-Bound and Minimum Spanning Tree
inferredcites →https://doi.org/10.1038/30918openalex-extracted
Collective dynamics of ‘small-world’ networks
inferredcites →https://doi.org/10.1038/scientificamerican0503-60openalex-extracted
Scale-Free Networks
inferredcites →https://doi.org/10.1073/pnas.1314337111openalex-extracted
Species interactions and the structure of complex communication networks
inferredcites →https://doi.org/10.1080/00401706.2013.804438openalex-extracted
Bayesian Nonparametric Models for Community Detection
inferredcites →https://doi.org/10.1080/01621459.2020.1833888openalex-extracted
Hierarchical Community Detection by Recursive Partitioning
inferredcites →https://doi.org/10.1109/tkde.2021.3104155openalex-extracted
A Survey of Community Detection Approaches: From Statistical Modeling to Deep Learning
inferredcites →https://doi.org/10.1145/3361739openalex-extracted
Local Overlapping Community Detection
inferredcites →https://doi.org/10.48550/arxiv.1810.01509openalex-snapshot
Hierarchical Community Detection by Recursive Partitioning
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.