Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
Author:
Funder
Romanian Ministry of Research and Innovation
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics
Link
https://epubs.siam.org/doi/pdf/10.1137/20M1330415
Reference18 articles.
1. Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
2. Approximate distance oracles for unweighted graphs in expected O ( n 2 ) time
3. On Graphs that do not Contain a Thomsen Graph
Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Methods for determining cycles of a specific length in undirected graphs with edge weights;Journal of Combinatorial Optimization;2023-11-19
2. Exact Algorithms for Finding Fixed-Length Cycles in Edge-Weighted Graphs;2022 International Conference on Computer Communications and Networks (ICCCN);2022-07
3. Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3