Complexity of Finding k-Path-Free Dominating Sets in Graphs - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Reuven Bar-Yehuda, Uzi Vishkin. Complexity of Finding k-Path-Free Dominating Sets in Graphs. Inf. Process. Lett., 14(5):228-232, 1982.

@article{Bar-YehudaV82,
  title = {Complexity of Finding k-Path-Free Dominating Sets in Graphs},
  author = {Reuven Bar-Yehuda and Uzi Vishkin},
  year = {1982},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Bar-YehudaV82},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {14},
  number = {5},
  pages = {228-232},
}

runs on WebDSL