Login / Signup

Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs.

Sarah-Marie BelcastroRuth Haas
Published in: Discret. Math. (2014)
Keyphrases
  • equivalence classes
  • weighted graph
  • edge detection
  • undirected graph
  • multiscale
  • graph theoretic
  • equivalence class
  • optimal solution
  • np hard
  • probability distribution
  • state space
  • greedy algorithm