Parameterized algorithms and data reduction for the short secluded s ‐ t ‐path problem-Reference-Cited by-同舟云学术

Parameterized algorithms and data reduction for the short secluded s ‐ t ‐path problem

Published:2019-08-28 Issue:1 Volume:75 Page:34-63
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks.

Author:

Bevern René¹^ORCID,Fluschnik Till²^ORCID,Tsidulko Oxana Yu.¹³^ORCID

Affiliation:

1. Department of Mechanics and Mathematics Novosibirsk State University Novosibirsk Russian Federation

2. Algorithmics and Computational Complexity Faculty IV, TU Berlin Berlin Germany

3. Sobolev Institute of Mathematics Siberian Branch of the Russian Academy of Sciences Novosibirsk Russian Federation

Funder

Deutsche Forschungsgemeinschaft

Ministry of Education and Science of the Russian Federation

Russian Foundation for Basic Research

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.21904

Reference50 articles.

1. Not being (super)thin or solid is hard: A study of grid Hamiltonicity

2. Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference

3. Route Planning in Transportation Networks

4. The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs

5. R.vanBevern T.Fluschnik andO.Yu.Tsidulko Parameterized algorithms and data reduction for safe convoy routing Proc. 18th ATMOS Vol. 65 ofOASIcs Schloss Dagstuhl–Leibniz‐Zentrum für Informatik 2018 pp. 10:1–10:19.

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

1. Finding k-secluded trees faster;Journal of Computer and System Sciences;2023-12

2. Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies;Journal of Computer and System Sciences;2022-06

3. Finding k-Secluded Trees Faster;Graph-Theoretic Concepts in Computer Science;2022

4. Finding connected secluded subgraphs;Journal of Computer and System Sciences;2020-11

5. On approximate data reduction for the Rural Postman Problem: Theory and experiments;Networks;2020-10-06