Chinese Postman Problem on Edge-Colored Multigraphs
classification
💻 cs.DS
math.CO
keywords
problemchinesegraphspostmandirectededge-coloredmultigraphsresult
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.