Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes.
Florent FoucaudPublished in: J. Discrete Algorithms (2015)
Keyphrases
- tractable cases
- decision problems
- approximation error
- computational complexity
- graph structure
- decision making
- complexity measures
- graph model
- random walk
- decision makers
- graph theory
- weighted graph
- convex sets
- closed form
- bounded treewidth
- bipartite graph
- upper bound
- graph representation
- worst case
- causal graph
- training set
- graph partitioning
- graph matching
- error bounds
- multi objective
- structured data