Paths of bounded length and their cuts: Parameterized complexity and algorithms-Reference-Cited by-同舟云学术

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

Paths of bounded length and their cuts: Parameterized complexity and algorithms

Published:2011-02 Issue:1 Volume:8 Page:72-86
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Golovach Petr A.,Thilikos Dimitrios M.

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference36 articles.

1. Über reguläre Baumkurven;Menger;Math. Ann.,1927

2. On the max-flow min-cut theorem of networks;Dantzig,1956

3. Maximal flow through a network;Ford;Canad. J. Math.,1956

4. Remarks on flows in network with short paths;Adámek;Comment. Math. Univ. Carolin.,1971

5. Mengerian theorems for paths of bounded length;Lovász;Period. Math. Hungar.,1978

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

1. Snapshot disjointness in temporal graphs;Theoretical Computer Science;2024-09

2. A survey of parameterized algorithms and the complexity of edge modification;Computer Science Review;2023-05

3. Multistage s–t Path: Confronting Similarity with Dissimilarity;Algorithmica;2023-01-03

4. Interference-free walks in time: temporally disjoint paths;Autonomous Agents and Multi-Agent Systems;2022-10-21

5. Length-bounded cuts: Proper interval graphs and structural parameters;Journal of Computer and System Sciences;2022-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP