Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs.
Florent FoucaudGeorge B. MertziosReza NaserasrAline ParreauPetru ValicovPublished in: WG (2015)
Keyphrases
- computational cost
- worst case
- computational complexity
- high computational complexity
- polynomial time complexity
- computationally efficient
- learning algorithm
- complexity measures
- data mining techniques
- theoretical analysis
- decision problems
- memory requirements
- space complexity
- nearest neighbor
- lower complexity
- significant improvement
- graph properties
- neural network