Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity-Reference-Cited by-同舟云学术

Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity

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:

Miyauchi Atsushi¹^ORCID,Chen Tianyi²^ORCID,Sotiropoulos Konstantinos²^ORCID,Tsourakakis Charalampos E.²^ORCID

Affiliation:

1. CENTAI Institute, Turin, Italy

2. Boston University, Boston, MA, USA

Publisher

ACM

Link

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

Reference48 articles.

1. Information Content of Colored Motifs in Complex Networks

2. Sara Ahmadian , Alessandro Epasto , Marina Knittel , Ravi Kumar , Mohammad Mahdian , Benjamin Moseley , Philip Pham , Sergei Vassilvitskii , and Yuyan Wang . 2020 a. Fair hierarchical clustering . In NeurIPS '20 . 21050--21060. Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, and Yuyan Wang. 2020a. Fair hierarchical clustering. In NeurIPS '20. 21050--21060.

3. Sara Ahmadian , Alessandro Epasto , Ravi Kumar , and Mohammad Mahdian . 2020 b. Fair correlation clustering . In AISTATS '20 . 4195--4205. Sara Ahmadian, Alessandro Epasto, Ravi Kumar, and Mohammad Mahdian. 2020b. Fair correlation clustering. In AISTATS '20. 4195--4205.

4. Spectral Relaxations and Fair Densest Subgraphs

5. Finding Dense Subgraphs with Size Bounds

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

1. A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery;Proceedings of the ACM on Management of Data;2024-05-29

2. Fair Projections as a Means Towards Balanced Recommendations;ACM Transactions on Intelligent Systems and Technology;2024-05-14

3. A Survey on the Densest Subgraph Problem and its Variants;ACM Computing Surveys;2024-04-30

4. Fair Densest Subgraph Across Multiple Graphs;Lecture Notes in Computer Science;2024