Exploring Cohesive Subgraphs in Hypergraphs: The (k,g)-core Approach-Reference-Cited by-同舟云学术

Exploring Cohesive Subgraphs in Hypergraphs: The (k,g)-core Approach

Published:2023-10-21 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 32nd ACM International Conference on Information and Knowledge Management
language:
Short-container-title:

Author:

Kim Dahee¹^ORCID,Kim Junghoon¹^ORCID,Lim Sungsu²^ORCID,Jeong Hyun Ji³^ORCID

Affiliation:

1. Ulsan National Institute of Science & Technology, Ulsan, Republic of Korea

2. Chungnam National University, Daejeon, Republic of Korea

3. Kongju National University, Cheonan, Republic of Korea

Funder

Institute of Information & communications Technology Planning & Evaluation(IITP)

The Settlement Research Fund UNIST(Ulsan National Institute of Science & Technology)

National Research Foundation of Korea (NRF)

Publisher

ACM

Link

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

Reference30 articles.

1. Abhijin Adiga and Anil Kumar S Vullikanti . 2013 . How robust is the core of a network? . In Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23--27, 2013, Proceedings, Part I 13 . Springer, 541--556. Abhijin Adiga and Anil Kumar S Vullikanti. 2013. How robust is the core of a network?. In Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23--27, 2013, Proceedings, Part I 13. Springer, 541--556.

2. Neighborhood-Based Hypergraph Core Decomposition

3. Connection and separation in hypergraphs

4. 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).

5. Fast algorithms for determining (generalized) core groups in social networks