Finding a longest nonnegative path in a constant degree tree - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Finding a longest nonnegative path in a constant degree tree. Inf. Process. Lett., 93(6):275-279, 2005. [doi]

@article{Kim05,
  title = {Finding a longest nonnegative path in a constant degree tree},
  year = {2005},
  doi = {10.1016/j.ipl.2004.11.012},
  url = {http://dx.doi.org/10.1016/j.ipl.2004.11.012},
  researchr = {https://researchr.org/publication/Kim05},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {93},
  number = {6},
  pages = {275-279},
}

runs on WebDSL