Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity.
Florent FoucaudGeorge B. MertziosReza NaserasrAline ParreauPetru ValicovPublished in: Algorithmica (2017)
Keyphrases
- computational complexity
- graph theory
- computational cost
- worst case
- complexity analysis
- computationally efficient
- lower complexity
- space complexity
- learning algorithm
- theoretical analysis
- decision problems
- evaluation metrics
- maximum common subgraph
- graph theoretic
- metric learning
- graphical models
- high dimensional
- lower bound
- data structure