Finding Densest Subgraphs with Edge-Color Constraints-Reference-Cited by-同舟云学术

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

Finding Densest Subgraphs with Edge-Color Constraints

Published:2024-05-13 Issue: Volume:37203 Page:936-947
ISSN:
Container-title:Proceedings of the ACM Web Conference 2024
language:
Short-container-title:

Author:

Oettershagen Lutz¹^ORCID,Wang Honglian¹^ORCID,Gionis Aristides¹^ORCID

Affiliation:

1. KTH Royal Institute of Technology, Stockholm, Sweden

Funder

ERC Advanced Grant REBOUND

EC H2020 RIA project SoBigData++

Wallenberg AI, Autonomous Systems and Software Program

Publisher

ACM

Link

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

Reference45 articles.

1. Spectral Relaxations and Fair Densest Subgraphs

2. Finding Dense Subgraphs with Size Bounds

3. Dense subgraph maintenance under streaming edge weight updates for real-time story identification

4. Greedily Finding a Dense Subgraph

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

Cited by 2 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. Fair Densest Subgraph Across Multiple Graphs;Lecture Notes in Computer Science;2024

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP