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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics Jg. 227; S. 13 - 20
Hauptverfasser:	Gribanov, D.V., Malyshev, D.S.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 20.08.2017 Elsevier BV
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!