Polynomial kernels for tracking shortest paths

DOI10.1016/j.ipl.2022.106315OpenAlexW4294631326MaRDI QIDQ2094386

Dušan Knop, Pratibha Choudhary, Ondřej Suchý, Václav Blažej, Jan Matyáš Křišt'an, Tomáš Valla

Publication date: 28 October 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.11927

zbMATH Keywords

shortest pathskernelgraph algorithmsdirected acyclic graphstracking paths

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Improved kernels for tracking paths

Cites Work

• Exact exponential algorithms.
• How to catch marathon cheaters: new approximation algorithms for tracking paths
• Tracking paths
• Fixed-parameter tractable algorithms for tracking shortest paths
• Fixed-parameter tractable algorithms for tracking set problems
• Parameterized Algorithms
• A polynomial sized kernel for tracking paths problem

This page was built for publication: Polynomial kernels for tracking shortest paths