Journal ArticleOPEN ACCESS

On the complexity of edge traversing

Journal of the ACM (JACM) (1976) 23(3) 544-554
DOI: 10.1145/321958.321974
118Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

Abstract

It is shown that the Chinese Postman Problem, although tractable in the totally directed and the totally undirected cases, is NP-complete in the mixed case. A simpler version of the same problem is shown algorithmically equivalent to the max-flow problem with unit edge capacities. © 1976, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Papadimitriou, C. H. (1976). On the complexity of edge traversing. Journal of the ACM (JACM), 23(3), 544–554. https://doi.org/10.1145/321958.321974

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