On the use of Boolean methods for the computation of the stability number
From MaRDI portal
Publication:1363750
DOI10.1016/S0166-218X(96)00124-2zbMATH Open0879.05039MaRDI QIDQ1363750FDOQ1363750
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
Recommendations
Applications of mathematical programming (90C90) Extremal problems in graph theory (05C35) Boolean programming (90C09) Boolean functions (06E30)
Cites Work
- Matching theory
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On maximal independent sets of vertices in claw-free graphs
- Linear recognition of pseudo-split graphs
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- The splittance of a graph
- `` Strong NP-Completeness Results
- Stability number of bull- and chair-free graphs
- Stability in circular arc graphs
- On the vertex packing problem
- The struction of a graph: Application to CN-free graphs
- Polynomially solvable cases for the maximum stable set problem
- Title not available (Why is that?)
- Stability in CAN-free graphs
- Title not available (Why is that?)
- Quelques utilisations de la STRUCTION. (Some applications of STRUCTION)
- On the stability number of AH‐free graphs
- On the Maximum Weight Clique Problem
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
Cited In (14)
- Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization
- Extending the MAX algorithm for maximum independent set
- A magnetic procedure for the stability number
- Title not available (Why is that?)
- Pseudo-Boolean optimization
- Struction revisited
- On the stable set problem in special \(P_{5}\)-free graphs
- Stability number in subclasses of \(P_5\)-free graphs
- Stability in \(P_5\)- and banner-free graphs
- From matchings to independent sets
- Stability preserving transformations of graphs
- Graph transformations preserving the stability number
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
