MathDB2 problems
- 0 votes0 replies0 views
Safe set is NP-complete for strong tournaments
Strong-tournament safe-set conjecture. The safe-set problem is NP-complete for strong tournaments.
- 0 votes0 replies0 views
Polynomial-time safe-set algorithm for clique-acyclic digraphs
Safe-set algorithm conjecture. There exists a polynomial-time algorithm to find a minimum safe set in a clique acyclic digraph with a constant independence number .