3 papers
cs.SI2026
Improved Methods for k-core Community Search
Ian Chen, Haotian Yi, Arun Sharma +2
Community search based on user-specified query nodes is complementary to community finding or graph clustering. Prior work in community search is divided into optimizing for extern…
cs.SI2025
Dense Subgraph Clustering and a New Cluster Ensemble Method
The-Anh Vu-Le, João Alfredo Cardoso Lamy, Tomás Alessi +5
We propose DSC-Flow-Iter, a new community detection algorithm that is based on iterative extraction of dense subgraphs. Although DSC-Flow-Iter leaves many nodes unclustered, it is…
cs.SI2025
Using Stochastic Block Models for Community Detection: The issue of edge-connectivity
The-Anh Vu-Le, Minhyuk Park, Ian Chen +2
A relevant, sometimes overlooked, quality criterion for communities in graphs is that they should be well-connected in addition to being edge-dense. Prior work has shown that leadi…