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

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

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.