Efficient Densest Subgraphs Discovery in Large Dynamic Graphs by Greedy Approximation
Densest subgraph detection has become an important primitive in graph mining tasks when analyzing communities and detecting events in a wide range of application domains. Currently, it is a challenging and practically crucial research issue to develop efficient densest subgraphs mining approaches th...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10127973/ |