Database Paper Browser

Back to papers

Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks

Summary: Introduces the first meta-path-based formulation of type-specific betweenness centrality on heterogeneous information networks, defining coarse-grained and fine-grained BC (cBC, fBC). Provides a generalized algorithm and optimizations (network compression, BFS-DAG sharing) to scale cBC/fBC, validated on real HINs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13548
Venue
VLDB
Year
2024
Pagerank
4.1945683e-05
Overall Rank
11,064 | 23.03%
DOI
10.14778/3681954.3682006

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,477 Revisiting Graph Analytics Benchmark 2025 SIGMOD 4.3341665e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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