Pith. sign in

Survey of target tracking protocols using wireless sensor network

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.DM 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Tracking Paths in Planar Graphs

cs.DM · 2019-08-15 · conditional · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Tracking Paths in Planar Graphs cs.DM · 2019-08-15 · conditional · none · ref 6

    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.