• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Computational complexity of counting problems on 3-regular planar graphs.

Mingji XiaPeng ZhangWenbo Zhao
Published in: Theor. Comput. Sci. (2007)
Keyphrases
  • planar graphs
  • computational complexity
  • np complete
  • decision problems
  • vertex cover
  • optimal solution
  • special case
  • linear programming
  • problems in computer vision