Efficient Monte Carlo Algorithms for Approximating Katz Centrality on Large Graphs.
Garrett W. Cornett|Minh Phu Vuong|Chul-Ho Lee
| Anthology ID: | DBLP:conf/wsdm/CornettVL26 |
|---|---|
| Volume: | Proceedings of the Nineteenth ACM International Conference on Web Search and Data Mining, WSDM 2026, Boise, ID, USA, February 22-26, 2026 |
| Year: | 2026 |
| Venue: | Web Search and Data Mining (WSDM) |
| Publisher: | ACM |
| Pages: | 1120-1124 |
| URL: | https://doi.org/10.1145/3773966.3779378 |
| DOI: | https://doi.org/10.1145/3773966.3779378 |
| DBLP: | conf/wsdm/CornettVL26 |
| BibTeX: |
@inproceedings{cornett-2026-efficient,
author = {Garrett W. Cornett and
Minh Phu Vuong and
Chul-Ho Lee},
title = {{Efficient Monte Carlo Algorithms for Approximating Katz Centrality on Large Graphs}},
booktitle = {{Proceedings of the Nineteenth ACM International Conference on Web Search and Data Mining, WSDM 2026, Boise, ID, USA, February 22-26, 2026}},
pages = {1120--1124},
publisher = {ACM},
year = {2026},
url = {https://doi.org/10.1145/3773966.3779378},
doi = {https://doi.org/10.1145/3773966.3779378}
}