登录 注册 会员服务 联系我们

The Generalized Mean Densest Subgraph Problem

  • Published:2021-08-14 Issue: Volume: Page:
  • ISSN:
  • Container-title:Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining
  • language:
  • Short-container-title:

Author:

Veldt Nate1,Benson Austin R.1,Kleinberg Jon1

Affiliation:

1. Cornell University, Ithaca, NY, USA

Funder

DOD U.S. Department of Defense

NSF (National Science Foundation)

JPMorgan Chase and Company

Army Research Office

Simons Foundation

Air Force Office of Scientific Research

Publisher

ACM

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

1. A Unified Core Structure in Multiplex Networks: From Finding the Densest Subgraph to Modeling User Engagement;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

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

3. Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods;Proceedings of the ACM Web Conference 2024;2024-05-13

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

5. Generalized Densest Subgraph in Multiplex Networks;Studies in Computational Intelligence;2024
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3