Login / Signup
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs.
Ali Dehghan
Mohsen Molla Haji Aghaei
Published in:
Discret. Appl. Math. (2017)
Keyphrases
</>
undirected graph
small number
maximum number
data sets
neural network
search algorithm
computational complexity
simulated annealing