Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization
type: Item
instance of: scholarly article
title: Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization
zbMATH Open document ID: 1213.90016
author: Peter L. Hammer
author: Dominique De Werra
published in: Annals of Operations Research
publication date: 2011-05-20T00:00:00Z
full work available at URL: 10479 2006 Article 101.pdf
Mathematics Subject Classification ID: 90-03
Mathematics Subject Classification ID: 01A60
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 5898427
MaRDI profile type: Publication
OpenAlex ID: W2067750021
cites work: Struction revisited
cites work: Q5668821
cites work: Q3682509
cites work: Polynomially solvable cases for the maximum stable set problem
cites work: On the use of Boolean methods for the computation of the stability number
cites work: Q4198056
cites work: Stability in CAN-free graphs
cites work: The struction of a graph: Application to CN-free graphs
DOI: 10.1007/S10479-006-0101-0
description: scientific article; zbMATH DE number 5898427