On the Complexity of k-Metric Antidimension Problem and the Size of k-Antiresolving Sets in Random Graphs.

Congsong Zhang Yong Gao

Published in: COCOON (2017)

Keyphrases

random graphs
space complexity
computational complexity
graph theoretic
small world
learning curves
memory requirements
phase transition