On the complexity of edge traversing

Authors:
Christos H. Papadimitriou
Affiliations:
Department of Electrical Engineering, Princeton University, Brackett Hall, Engineering Quadrangle, Princeton, NJ
Venue:
Journal of the ACM (JACM)
Year:
1976

Citing 3
Cited 17

Algorithm 447: efficient algorithms for graph manipulation

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Testing graph connectivity

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing

Finding Postal Carrier Walk Paths in Mixed Graphs

Computational Optimization and Applications
Approximation algorithms for the asymmetric postman problem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Some Postman Problems

Journal of the ACM (JACM)
Finding rural postman tours

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
A Matroid-Theoretic Solution to an Assignment Problem in the Conformance Testing of Communication Protocols

IEEE Transactions on Computers
Minimal length test vectors for multiple-fault detection

Theoretical Computer Science - Mathematical foundations of programming semantics
A comparison of two different formulations for arc routing problems on mixed graphs

Computers and Operations Research
A comprehensive problem for algorithm and paradigm visualization

Journal of Computing Sciences in Colleges
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

Discrete Applied Mathematics
Experimental studies of graph traversal algorithms

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Approximate mechanisms for the graphical TSP and other graph traversal problems

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Genetic algorithm for mixed Chinese postman problem

ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
Exploring an unknown graph efficiently

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Cycle cover with short cycles

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On the mixed Chinese postman problem

Operations Research Letters
Solvable cases of the k-person Chinese postman problem

Operations Research Letters
On negative cycles in mixed graphs

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

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.