An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Ulrich Derigs. An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths. Inf. Process. Lett., 21(5):253-258, 1985.

@article{Derigs85,
  title = {An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths},
  author = {Ulrich Derigs},
  year = {1985},
  researchr = {https://researchr.org/publication/Derigs85},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {21},
  number = {5},
  pages = {253-258},
}

runs on WebDSL