Parameterized and approximation complexity of the detection pair problem in graphs.
Florent FoucaudRalf KlasingPublished in: CoRR (2016)
Keyphrases
- approximation error
- detection algorithm
- detection accuracy
- pairwise
- worst case
- false positives
- increase in computational complexity
- error tolerance
- weighted graph
- automatic detection
- closed form
- detection method
- detection rate
- graph theory
- decision problems
- false alarms
- approximation algorithms
- graph structure
- space complexity
- graph theoretic
- object detection
- graph structures
- computational cost
- representational power
- neural network