Login / Signup

Some computational aspects of solvable regular covers of graphs.

Rok Pozar
Published in: J. Symb. Comput. (2015)
Keyphrases
  • dynamic graph
  • special case
  • np hard
  • np complete
  • computational complexity
  • neural network
  • book covers
  • database
  • real time
  • databases
  • feature selection