Export Citations
2 Results for: Keyword: dense subgraph search
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Searched The ACM Guide to Computing Literature (3,802,301 records)|Limit your search to The ACM Full-Text Collection (771,863 records)
Select All
- research-articleMay 2024
On Density-based Local Community Search
Proceedings of the ACM on Management of Data (PACMMOD), Volume 2, Issue 2Article No.: 88, Pages 1–25https://doi.org/10.1145/3651589Local community search (LCS) finds a community in a given graph G local to a set R of seed nodes by optimizing an objective function. The objective function f(S) for an induced subgraph S encodes the set inclusion criteria of R to a classic community ...
- research-articleJune 2022
Anchored Densest Subgraph
SIGMOD '22: Proceedings of the 2022 International Conference on Management of DataPages 1200–1213https://doi.org/10.1145/3514221.3517890Given a graph, densest subgraph search reports a single subgraph that maximizes the density (i.e., average degree). To diversify the search results without imposing rigid constraints, this paper studies the problem of anchored densest subgraph search (...
