Login / Signup

Spectral lower bounds for the quantum chromatic number of a graph.

Clive ElphickPawel Wocjan
Published in: J. Comb. Theory, Ser. A (2019)
Keyphrases
  • lower bound
  • upper bound
  • computational complexity
  • graph representation
  • branch and bound algorithm
  • undirected graph
  • data structure
  • search algorithm
  • graph theory
  • graph model