Chinese Postman Problem on Edge-Colored Multigraphs
نویسندگان
چکیده
It is well-known that the Chinese Postman Problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese Postman Problem on mixed graphs, i.e., graphs with directed and undirected edges, for which the problem is NP-hard.
منابع مشابه
The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs
The famous Chinese Postman Problem (CPP) is polynomial time solvable on both undirected and directed graphs. Gutin et al. [Discrete Applied Math 217 (2016)] generalized these results by proving that CPP on c-edge-colored graphs is polynomial time solvable for every c ≥ 2. In CPP on weighted edge-colored graphs G, we wish to find a minimum weight properly colored closed walk containing all edges...
متن کاملThe directed Chinese Postman Problem
The Chinese Postman Problem has many applications, including robot exploration, and analysing interactive system and web site usability. This paper reviews the wide range of applications of the problem and presents complete, executable code to solve it for the case of directed multigraphs. A variation called the ‘open Chinese Postman Problem’ is also introduced and solved. Although optimisation...
متن کاملSharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs
The Chinese Postman Problem in a multigraph is the problem of finding a shortest closed walk traversing all the edges. In a (2r + 1)-regular multigraph, the problem is equivalent to finding a smallest spanning subgraph in which all vertices have odd degree. In 1994, Kostochka and Tulai established a sharp upper bound for the solution. In this paper, we give simple proofs of their bounds for 3-r...
متن کاملA decomposition of Gallai multigraphs
An edge-colored cycle is rainbow if its edges are colored with distinct colors. A Gallai (multi) graph is a simple, complete, edge-colored (multi) graph lacking rainbow triangles. As has been previously shown for Gallai graphs, we show that Gallai multigraphs admit a simple iterative construction. Moreover, we show that Gallai multigraphs give rise to a surprising and highly structured decompos...
متن کاملEdge-coloring series-parallel multigraphs
We give a simpler proof of Seymour’s Theorem on edge-coloring series-parallel multigraphs and derive a linear-time algorithm to check whether a given series-parallel multigraph can be colored with a given number of colors.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 217 شماره
صفحات -
تاریخ انتشار 2017