Login / Signup

A Complexity Dichotomy for the Coloring of Sparse Graphs.

Louis EsperetMickaël MontassierPascal OchemAlexandre Pinlou
Published in: J. Graph Theory (2013)
Keyphrases
  • computational cost
  • decision problems
  • neural network
  • graphical models
  • graph theory
  • graph representation
  • directed acyclic
  • worst case
  • graph partitioning
  • sparse data
  • graph structures
  • sparse sampling