On the use of Boolean methods for the computation of the stability number

DOI10.1016/S0166-218X(96)00124-2MaRDI QIDQ1363750zbMATHFDO

Authors Alain Hertz

Publication date 12 January 1998

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

stability number

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Extremal problems in graph theory (05C35) Boolean programming (90C09) Boolean functions (06E30)

Recommendations

• Publication:4505839
• scientific article; zbMATH DE number 3904619
• On the stability number of AH‐free graphs
• Polynomially solvable cases for the maximum stable set problem
• Stability number of bull- and chair-free graphs

Cites work

• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 3904619 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3598234 (Why is no real title available?)
• scientific article; zbMATH DE number 3618209 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• Linear recognition of pseudo-split graphs
• Matching theory
• On maximal independent sets of vertices in claw-free graphs
• On the Maximum Weight Clique Problem
• On the stability number of AH‐free graphs
• On the vertex packing problem
• Polynomially solvable cases for the maximum stable set problem
• Quelques utilisations de la STRUCTION. (Some applications of STRUCTION)
• Stability in CAN-free graphs
• Stability in circular arc graphs
• Stability number of bull- and chair-free graphs
• The splittance of a graph
• The struction of a graph: Application to CN-free graphs
• `` Strong NP-Completeness Results

Cited in

(14)

• Graph transformations preserving the stability number
• Pseudo-Boolean optimization
• Stability preserving transformations of graphs
• Stability in \(P_5\)- and banner-free graphs
• Extending the MAX algorithm for maximum independent set
• scientific article; zbMATH DE number 3904619 (Why is no real title available?)
• On the stable set problem in special \(P_{5}\)-free graphs
• A magnetic procedure for the stability number
• From matchings to independent sets
• Struction revisited
• Stability number in subclasses of \(P_5\)-free graphs
• scientific article; zbMATH DE number 1512194 (Why is no real title available?)
• Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization
• scientific article; zbMATH DE number 3983193 (Why is no real title available?)

This page was built for publication: On the use of Boolean methods for the computation of the stability number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363750)