Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches-Reference-Cited by-同舟云学术

Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches

Published:2014-08-24 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
language:
Short-container-title:

Author:

Yoshida Yuichi¹

Affiliation:

1. Ntional Institute of Informatics, Tokyo, Japan

Funder

Japan Society for the Promotion of Science

Japan Science and Technology Agency

Ministry of Education, Culture, Sports, Science, and Technology

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2623330.2623626

Reference25 articles.

1. Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling

2. Fast exact shortest-path distance queries on large networks by pruned landmark labeling

3. A Graph-theoretic perspective on centrality

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A survey on optimization studies of group centrality metrics;Networks;2024-08-21

2. Efficient processing of coverage centrality queries on road networks;World Wide Web;2024-04-12

3. Time-sensitive propagation values discount centrality measure;Computing;2024-03-04

4. Efficient Algorithm for Maximizing Betweenness Centrality in Large Networks;2023 IEEE International Conference on High Performance Computing & Communications, Data Science & Systems, Smart City & Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys);2023-12-17

5. SILVAN : Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds;ACM Transactions on Knowledge Discovery from Data;2023-12-09