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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP