On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms.

Antoni Lozano Vijay Raghavan

Published in: FSTTCS (1998)

Keyphrases

computational complexity
space complexity
random graphs
polynomial time complexity
graph theory
weighted graph
edge weights
genetic algorithm
computational cost
small number
maximum number
hamiltonian cycle
directed edges