A Higher-Order Temporal H-Index for Evolving Networks-Reference-Cited by-同舟云学术

A Higher-Order Temporal H-Index for Evolving Networks

Published:2023-08-04 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Oettershagen Lutz¹^ORCID,Kriege Nils M.²^ORCID,Mutzel Petra³^ORCID

Affiliation:

1. KTH Royal Institute of Technology, Stockholm, Sweden

2. University of Vienna, Vienna, Austria

3. University of Bonn, Bonn, Germany

Funder

Vienna Science and Technology Fund

Deutsche Forschungsgemeinschaft

Lamarr-Institute for Machine Learning and Artificial Intelligence

EC H2020 RIA project SoBigData++

ERC Advanced Grant REBOUND

Publisher

ACM

Link

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

Reference75 articles.

1. J Ignacio Alvarez-Hamelin , Luca Dall'Asta , Alain Barrat , and Alessandro Vespignani . 2006 . How the k-core decomposition helps in understanding the internet topology . In ISMA Workshop on the Internet Topology , Vol. 1 . J Ignacio Alvarez-Hamelin, Luca Dall'Asta, Alain Barrat, and Alessandro Vespignani. 2006. How the k-core decomposition helps in understanding the internet topology. In ISMA Workshop on the Internet Topology, Vol. 1.

2. Joonhyun Bae and Sangwook Kim . 2014. Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A: Statistical Mechanics and its Applications , Vol. 395 ( 2014 ), 549--559. Joonhyun Bae and Sangwook Kim. 2014. Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A: Statistical Mechanics and its Applications, Vol. 395 (2014), 549--559.

3. Vladimir Batagelj and Matjaz Zaversnik . 2003. An O(m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049 ( 2003 ). Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049 (2003).

4. Ferenc Béres , Róbert Pálovics , Anna Oláh , and András A. Benczúr . 2018. Temporal walk based centrality metric for graph streams . Applied Network Science , Vol. 3 , 1 ( 2018 ), 32:1--32:26. https://doi.org/10.1007/s41109-018- 0080 - 0085 10.1007/s41109-018-0080-5 Ferenc Béres, Róbert Pálovics, Anna Oláh, and András A. Benczúr. 2018. Temporal walk based centrality metric for graph streams. Applied Network Science , Vol. 3, 1 (2018), 32:1--32:26. https://doi.org/10.1007/s41109-018-0080-5

5. A faster algorithm for betweenness centrality*

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

1. Scalable Temporal Motif Densest Subnetwork Discovery;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. Scalable Community Search over Large-scale Graphs based on Graph Transformer;Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval;2024-07-10

3. Mining Temporal Networks;Companion Proceedings of the ACM Web Conference 2024;2024-05-13