Login / Signup

The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs.

Vikraman ArvindFrank FuhlbrückJohannes KöblerSebastian KuhnertGaurav Rattan
Published in: MFCS (2016)
Keyphrases
  • parameterized complexity
  • undirected graph
  • search algorithm
  • computational complexity
  • directed graph