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

被引：3
|
作者：
Gribanov, D. V. [1 ,2 ]
Malyshev, D. S. [2 ]
机构：
[1] Lobachevsky State Univ, 23 Gagarina Av, Nizhnii Novgorod 603950, Russia
[2] Natl Res Univ, Higher Sch Econ, 25-12 Bolshaja Pecherskaja Ulitsa, Nizhnii Novgorod 603155, Russia
来源：
DISCRETE APPLIED MATHEMATICS | 2017年 / 227卷
基金：
俄罗斯科学基金会;
关键词：
Boolean linear programming; Independent set problem; Dominating set problem; Matrix minor; Efficient algorithm; CLIQUE-WIDTH;
D O I：
10.1016/j.dam.2017.04.025
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We consider boolean linear programming formulations of the independent set, the vertex and the edge dominating set problems and prove their polynomial-time solvability for classes of graphs with (augmented) constraint matrices having bounded minors in the absolute value.(C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码：13 / 20
页数：8
相关论文
共 16 条
12