Login / Signup

The computational complexity of three graph problems for instances with bounded minors of constraint matrices.

Dmitry V. GribanovDmitriy S. Malyshev
Published in: Discret. Appl. Math. (2017)
Keyphrases
  • computational complexity
  • np complete
  • optimization problems
  • social networks
  • decision problems
  • bounded treewidth
  • special case
  • semi supervised
  • graph theory
  • graph theoretic
  • graph layout