• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

The computational complexity of dominating set problems for instances with bounded minors of constraint matrices

Discrete Optimization. 2018. Vol. 29. P. 103-110.

We consider boolean linear programming formulations of the vertex and edge dominating set problems and prove their polynomial-time solvability for classes of graphs with constraint matrices having bounded minors in the absolute value.