DBScholar

Back to papers

Efficient Structural Graph Clustering: An Index-Based Approach

Summary: Introduces an index-based SCAN algorithm supporting arbitrary ε and μ with output-sensitive clustering time, avoiding full-graph scans. Maintains the O(m)-space index under updates and substantially outperforms prior methods, including on billion-edge graphs. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
11927
Venue
VLDB
Year
2018
Pagerank
8.5183361e-05
Overall Rank
2,482 | 82.98%
DOI
10.14778/3157794.3157795

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{wen_vldb18,
        title = {{Efficient Structural Graph Clustering: An Index-Based Approach}},
        author = {Wen, Dong and Qin, Lu and Zhang, Ying and Chang, Lijun and Lin, Xuemin},
        journal = {PVLDB},
        series = {{VLDB} '18},
        volume = {11},
        number = {3},
        pages = {243--255},
        doi = {10.14778/3157794.3157795},
        url = {https://doi.org/10.14778/3157794.3157795},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers