Tracking paths is NP-complete on planar graphs, admits a 4-approximation, and is linear-time solvable on bounded clique-width graphs with a given decomposition.
Nonserial Dynamic Programming
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Tracking Paths in Planar Graphs
Tracking paths is NP-complete on planar graphs, admits a 4-approximation, and is linear-time solvable on bounded clique-width graphs with a given decomposition.