On Directed Covering and Domination Problems

@inproceedings{Hanaka2017OnDC,
  title={On Directed Covering and Domination Problems},
  author={Tesshu Hanaka and Naomi Nishimura and Hirotaka Ono},
  booktitle={ISAAC},
  year={2017}
}
In this paper, we study covering and domination problems on directed graphs. Although undirected Vertex Cover and Edge Dominating Set are well-studied classical graph problems, the directed versions have not been studied much due to the lack of clear definitions. We give natural definitions for Directed r-In (Out) Vertex Cover and Directed (p, q)Edge Dominating Set as directed generations of Vertex Cover and Edge Dominating Set. For these problems, we show that (1) Directed r-In (Out) Vertex… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 27 REFERENCES

, Pål Grønås Drange , Markus S . Dregi , Fedor V . Fomin , Daniel Lok - shtanov , and Michał Pilipczuk . A c k n 5 - approximation algorithm for treewidth

  • Hans L. Bodlaender
  • SIAM Journal on Computing
  • 2016

Similar Papers

Loading similar papers…