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

DOI10.1016/S0166-218X(96)00124-2zbMath0879.05039MaRDI QIDQ1363750

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

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

Related Items (11)

From matchings to independent sets ⋮ Struction revisited ⋮ Stability preserving transformations of graphs ⋮ Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization ⋮ Pseudo-Boolean optimization ⋮ A magnetic procedure for the stability number ⋮ Stability number in subclasses of \(P_5\)-free graphs ⋮ Graph transformations preserving the stability number ⋮ Stability in \(P_5\)- and banner-free graphs ⋮ Extending the MAX algorithm for maximum independent set ⋮ On the stable set problem in special \(P_{5}\)-free graphs

Cites Work

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

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