On approximating thed-girth of a graph-Reference-Cited by-同舟云学术

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

On approximating thed-girth of a graph

Published:2013-11 Issue:16-17 Volume:161 Page:2587-2596
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Peleg David,Sau Ignasi,Shalom Mordechai

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference26 articles.

1. Degree constrained subgraphs;Addario-Berry;Discrete Applied Mathematics,2008

2. On the approximability of some degree-constrained subgraph problems;Amini;Discrete Applied Mathematics,2012

3. Hardness and approximation of traffic grooming;Amini;Theoretical Computer Science,2009

4. Parameterized complexity of finding small degree-constrained subgraphs;Amini;Journal of Discrete Algorithms,2012

5. Approximation algorithms for NP-complete problems on planar graphs;Baker;Journal of the ACM,1994

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

1. Efficient Exact Minimum k-Core Search in Real-World Graphs;Proceedings of the 32nd ACM International Conference on Information and Knowledge Management;2023-10-21

2. Minimum k ‐cores and the k ‐core polytope;Networks;2021-11-03

3. STeP-Archival: Storage Integrity and Tamper Resistance Using Data Entanglement;IEEE Transactions on Information Theory;2018-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP