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

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.

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 227; pp. 13 - 20
Main Authors: Gribanov, D.V., Malyshev, D.S.
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 20.08.2017
Elsevier BV
Subjects:
Boolean algebra
Boolean linear programming
Combinatorics
Dominating set problem
Efficient algorithm
Formulations
Graphs
Independent set problem
Linear programming
Mathematical analysis
Matrix
Matrix methods
Matrix minor
Dominating set problem
Boolean linear programming
Independent set problem
Matrix minor
Efficient algorithm
ISSN:0166-218X, 1872-6771
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2017.04.025