1987/01/01 by Moshe Dror, Helman I. Stern, Pierre Trudeau · 1 citation
Computer Science · Biochemistry, Genetics and Molecular Biology · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #DNA and Biological Computing
paper · doi:10.1002/net.3230170304
openalex publication_date 1987/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/11
Abstract Since the introduction of the Chinese Postman Problem (CPP), many variations on the same theme have been developed. In this paper we examine still another variation. The arcs of the graph are partitioned and a precedence relation defined, specifying the order in which the elements of the partition have to be traversed. We first examine the conditions for a feasible solution to the problem. Next, we specify the graph properties of the precedence partition that insure a polynomial complexity solution of O(N 5 ), where N is the number of nodes in the original graph. When the precedence relation on sets of arcs is general, we prove that the problem of finding the minimum length of feasible postman tour is NP‐complete.