Postman tour on a graph with precedence relation on arcs

Moshe Dror, Helman Stern, Pierre Trudeau

Research output: Contribution to journalArticle

39 Citations (Scopus)

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
StatePublished - 1987
Externally publishedYes

Fingerprint

Polynomials

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Cite this

Postman tour on a graph with precedence relation on arcs. / Dror, Moshe; Stern, Helman; Trudeau, Pierre.

In: Networks, Vol. 17, No. 3, 1987, p. 283-294.

Research output: Contribution to journalArticle

Dror, Moshe ; Stern, Helman ; Trudeau, Pierre. / Postman tour on a graph with precedence relation on arcs. In: Networks. 1987 ; Vol. 17, No. 3. pp. 283-294.
@article{6016165b8f5546aeaee228f5ddda871a,
title = "Postman tour on a graph with precedence relation on arcs",
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.",
author = "Moshe Dror and Helman Stern and Pierre Trudeau",
year = "1987",
doi = "10.1002/net.3230170304",
language = "English (US)",
volume = "17",
pages = "283--294",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "3",

}

TY - JOUR

T1 - Postman tour on a graph with precedence relation on arcs

AU - Dror, Moshe

AU - Stern, Helman

AU - Trudeau, Pierre

PY - 1987

Y1 - 1987

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84987039902&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84987039902&partnerID=8YFLogxK

U2 - 10.1002/net.3230170304

DO - 10.1002/net.3230170304

M3 - Article

AN - SCOPUS:84987039902

VL - 17

SP - 283

EP - 294

JO - Networks

JF - Networks

SN - 0028-3045

IS - 3

ER -