On Finding a Minimum Dominating Set in a Tournament

@article{Megiddo1988OnFA,
  title={On Finding a Minimum Dominating Set in a Tournament},
  author={Nimrod Megiddo and Uzi Vishkin},
  journal={Theor. Comput. Sci.},
  year={1988},
  volume={61},
  pages={307-316}
}
The problem of nding a minimum dominating set in a tournament can be solved in njO logn time It is shown that if this problem has a polynomial time algorithm then for every constant C there is also a polynomial time algorithm for the satis ability problem of boolean formulas in conjunctive normal form with m clauses and C log j m variables On the other hand the problem can be reduced in polynomial time to a general satis abilty problem of length L with O log j L vari ables Another ration… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 24 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

F i s c her, \Reening nondeterminism in relativized polynomial-time bounded computations

  • Kf, C M R Kintala
  • SIAM J. Comput
  • 1980

Erdd os, \On a problem in graph theory

  • Math. Gaz
  • 1963

Similar Papers

Loading similar papers…