Skip to main content
Book Chapter

Chinese Postman and Euler Tour Problems in Bi-Directed Graphs

  • Johnson E
Springer US, (2000), 171-196
DOI: 10.1007/978-1-4615-4495-1_5
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Johnson, E. L. (2000). Chinese Postman and Euler Tour Problems in Bi-Directed Graphs. In Arc Routing (pp. 171–196). Springer US. https://doi.org/10.1007/978-1-4615-4495-1_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free