The following publications are possibly variants of this publication:
- Measuring and maximizing group closeness centrality over disk-resident graphsJunzhou Zhao, John C. S. Lui, Don Towsley, Xiaohong Guan. WWW 2014: 689-694 [doi]
- Toward Fast and Scalable Random Walks over Disk-Resident Graphs via Efficient I/O ManagementRui Wang, Yongkun Li 0001, Yinlong Xu, Hong Xie 0004, John C. S. Lui, Shuibing He. tos, 18(4), 2022. [doi]
- Subgraph Search over Massive Disk Resident GraphsPeng Peng, Lei Zou, Lei Chen 0002, Xuemin Lin, Dongyan Zhao. ssdbm 2011: 312-321 [doi]
- Efficient Closeness Centrality Computation for Dynamic GraphsZhenzhen Shao, Na Guo, Yu Gu 0002, Zhigang Wang, Fangfang Li, Ge Yu 0001. dasfaa 2020: 534-550 [doi]
- I/O Efficient Algorithms for Exact Distance Queries on Disk-Resident Dynamic GraphsYishi Lin, Xiaowei Chen, John C. S. Lui. asunam 2015: 440-447 [doi]
- Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data SegmentMengzhao Wang, Weizhi Xu 0003, Xiaomeng Yi, Songlin Wu, Zhangyang Peng, Xiangyu Ke, Yunjun Gao, Xiaoliang Xu, Rentong Guo, Charles Xie. pacmmod, 2(1), February 2024. [doi]
- Efficient Maximum Closeness Centrality Group IdentificationChen Chen, Wei Wang, Xiaoyang Wang. adc 2016: 43-55 [doi]