An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems-Reference-Cited by-同舟云学术

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

An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems

Published:2015-10 Issue: Volume:193 Page:145-161
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Komusiewicz Christian,Sorge Manuel

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference45 articles.

1. Color-coding;Alon;J. ACM,1995

2. Parameterized complexity of the smallest degree-constrained subgraph problem;Amini,2008

3. Clique relaxations in social network analysis: The maximum k-plex problem;Balasundaram;Oper. Res.,2011

4. Novel approaches for analyzing biological networks;Balasundaram;J. Comb. Optim.,2005

5. Graph theoretic clique relaxations and applications;Balasundaram,2013

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

1. A Fast Exact Algorithm to Enumerate Maximal Pseudo-cliques in Large Sparse Graphs;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. On the parameterized complexity of non-hereditary relaxations of clique;Theoretical Computer Science;2024-07

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

4. Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs;Lecture Notes in Computer Science;2024

5. Computing Dense and Sparse Subgraphs of Weakly Closed Graphs;Algorithmica;2023-01-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP