Parameterized and approximation complexity of the detection pair problem in graphs.
Florent FoucaudRalf KlasingPublished in: J. Graph Algorithms Appl. (2017)
Keyphrases
- approximation error
- automatic detection
- pairwise
- object detection
- worst case
- detection method
- false alarms
- closed form
- graph representation
- anomaly detection
- error bounds
- data sets
- special case
- error tolerance
- directed graph
- undirected graph
- polynomial time complexity
- detection accuracy
- increase in computational complexity
- approximation algorithms
- detection rate
- false positives
- computational complexity
- search algorithm
- social networks
- neural network