Maximum difference about the size of optimal identifying codes in graphs differing by one vertex.

Published in: Discret. Math. Theor. Comput. Sci. (2015)

Keyphrases

directed graph
maximum number
attributed graphs
graph theory
genetic algorithm
constant factor
dynamic programming
closed form
optimal control
undirected graph
maximal cliques
uniform random
maximum cardinality
minimum length
minimum distance
graph matching
worst case
pairwise
optimal solution