Improved shortest path algorithms for nearly acyclic graphs - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Shane Saunders, Tadao Takaoka. Improved shortest path algorithms for nearly acyclic graphs. Theoretical Computer Science, 293(3):535-556, 2003.

@article{SaundersT03,
  title = {Improved shortest path algorithms for nearly acyclic graphs},
  author = {Shane Saunders and Tadao Takaoka},
  year = {2003},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/SaundersT03},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {293},
  number = {3},
  pages = {535-556},
}

runs on WebDSL