Determining the number of internal stability of a graph
From MaRDI portal
Cites work
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- Anti-blocking polyhedra
- Covers and packings in a family of sets
- Determining the Stability Number of a Graph
- Finding a Maximum Independent Set
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3361920 (Why is no real title available?)
- Maximum internally stable sets of a graph
- Minimum node covers and 2-bicritical graphs
- On maximal independent sets of vertices in claw-free graphs
- On the facial structure of set packing polyhedra
- On the integer-valued variables in the linear vertex packing problem
- Vertex packings: Structural properties and algorithms
Cited in
(14)- The maximum clique problem
- A multi-KP modeling for the maximum-clique problem
- A branch-and-cut algorithm for the pallet loading problem
- An exact algorithm for the pallet loading problem
- Solving the maximum clique problem using a tabu search approach
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- An algorithm for the maximum internally stable set in a weighted graph
- A global optimization approach for solving the maximum clique problem
- Using Fifth Generation Tools for Solving the Clique Number Problem
- GEODETIC GAMES FOR GRAPHS
- A branch and bound algorithm for the maximum clique problem
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Finding maximum cliques in arbitrary and in special graphs
- An exact algorithm for the maximum clique problem
This page was built for publication: Determining the number of internal stability of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960887)
