Postman tour on a graph with precedence relation on arcs

Moshe Dror, Helman Stern, Pierre Trudeau

Research output: Contribution to journalArticle

39 Scopus citations

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(N5), 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.

Original languageEnglish (US)
Pages (from-to)283-294
Number of pages12
JournalNetworks
Volume17
Issue number3
DOIs
Publication statusPublished - 1987
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Cite this