Tracking paths
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- Fixed-parameter tractable algorithms for tracking set problems
- A polynomial sized kernel for tracking paths problem
- Tracking routes in communication networks
- Distance-based (and path-based) covering problems for graphs of given cyclomatic number
- On a method of pursuit in ``tracks
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set
- Polynomial time algorithms for tracking path problems
- Tracking paths
- Finding tracks detected by a drift tube system
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set
- A polynomial sized kernel for tracking paths problem
- The parameterized complexity of maximum betweenness centrality
- Improved kernels for tracking paths
- Trail saving on backtrack
- Steps and traces
- Walking through waypoints
- Polynomial kernels for tracking shortest paths
This page was built for publication: Tracking paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185723)