Scalable approximations to k-cycle transversal problems on dynamic networks-Reference-Cited by-同舟云学术

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

Scalable approximations to k-cycle transversal problems on dynamic networks

Published:2018-12-19 Issue:1 Volume:61 Page:65-84
ISSN:0219-1377
Container-title:Knowledge and Information Systems
language:en
Short-container-title:Knowl Inf Syst

Author:

Kuhnle Alan^ORCID,Crawford Victoria G.,Thai My T.

Funder

National Science Foundation

Defense Threat Reduction Agency

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Hardware and Architecture,Human-Computer Interaction,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/s10115-018-1296-5.pdf

Reference31 articles.

1. Arulselvan A, Commander CW, Elefteriadou L, Pardalos PM (2009) Detecting critical nodes in sparse graphs. Comput Oper Res 36(7):2193–2200

2. Bafna V, Berman P, Fujito T (1999) A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J Discrete Math 12(3):289–297

3. Barclay KJ, Edling C, Rydgren J (2013) Peer clustering of exercise and eating behaviours among young adults in Sweden: a cross-sectional study of egocentric network data. BMC Public Health 13:1–3

4. Bhattacharya S (2017) Fully dynamic approximate maximum matching and minimum vertex cover in O ( log 3 n ) worst case update time. In: Proceedings of the twenty-eighth annual ACM-SIAM symposium on discrete algorithms (SODA’17), (340506), pp 470–489

5. Bhattacharya S, Henzinger M, Italiano GF (2015) Design of dynamic algorithms via primal–dual method. In: International colloquium on automata, languages, and programming. Lecture notes in computer science, vol 9134, pp 206–218

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

1. TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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