Chinese Postman Problem on Edge-Colored Multigraphs
Data Structures and Algorithms
2016-09-13 v2 Combinatorics
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.
Keywords
Cite
@article{arxiv.1512.06283,
title = {Chinese Postman Problem on Edge-Colored Multigraphs},
author = {Gregory Gutin and Mark Jones and Bin Sheng and Magnus Wahlström and Anders Yeo},
journal= {arXiv preprint arXiv:1512.06283},
year = {2016}
}