Login / Signup

Acyclic colouring of 1-planar graphs.

Oleg V. BorodinAlexandr V. KostochkaAndré RaspaudÉric Sopena
Published in: Discret. Appl. Math. (2001)
Keyphrases
  • planar graphs
  • np hard
  • np complete
  • weighted graph
  • approximate inference
  • social networks
  • computational complexity
  • higher order
  • binary images
  • boundary points
  • minimum weight