Determining the Stability Number of a Graph
From MaRDI portal
Cited in
(21)- The maximum number of cliques in dense graphs
- Discrete extremal problems
- The maximum clique problem
- On comparing algorithms for the maximum clique problem
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- On the probable behaviour of some algorithms for finding the stability number of a graph
- Minimum node covers and 2-bicritical graphs
- A note on some computationally difficult set covering problems
- Determining the number of internal stability of a graph
- An algorithm for the maximum internally stable set in a weighted graph
- Approximating maximum independent sets by excluding subgraphs
- Constructing concrete hard instances of the maximum independent set problem
- On the complexity of cutting-plane proofs
- Graph theory (algorithmic, algebraic, and metric problems)
- Advice complexity of adaptive priority algorithms
- A hard problem that is almost always easy
- A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R
- Some combinatorial algorithms on the independent number of k-regular connected hypergraphs
- Lower bounds on dynamic programming for maximum weight independent set
- A note on the complexity of a partition algorithm
- Two party immediate response disputes: Properties and efficiency
This page was built for publication: Determining the Stability Number of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4177607)
