[HTML][HTML] 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 …
polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in …
Chinese Postman Problem on edge-colored multigraphs
G Gutin, M Jones, B Sheng, M Wahlström… - Discrete Applied …, 2017 - dl.acm.org
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 …
polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in …
[PDF][PDF] Chinese Postman Problem on Edge-Colored Multigraphs
G Gutin, M Jones, B Sheng, M Wahlström, A Yeo - 2016 - pure.royalholloway.ac.uk
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 …
polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in …
Chinese Postman Problem on edge-colored multigraphs
G Gutin, M Jones, B Sheng, M Wahlström… - Discrete Applied …, 2017 - infona.pl
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 …
polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in …
Chinese Postman Problem on Edge-Colored Multigraphs
G Gutin, M Jones, B Sheng, M Wahlström… - arXiv e …, 2015 - ui.adsabs.harvard.edu
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 …
polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in …
Chinese Postman Problem on edge-colored multigraphs
G Gutin, M Jones, B Sheng… - Discrete Applied …, 2017 - portal.findresearcher.sdu.dk
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 …
polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in …
[PDF][PDF] Chinese Postman Problem on Edge-Colored Multigraphs
G Gutin, M Jones, B Sheng, M Wahlström, A Yeo - 2016 - core.ac.uk
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 …
polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in …
Chinese Postman Problem on Edge-Colored Multigraphs
G Gutin, M Jones, B Sheng, M Wahlström… - arXiv preprint arXiv …, 2015 - arxiv.org
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 …
polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in …
[PDF][PDF] Chinese Postman Problem on Edge-Colored Multigraphs
G Gutin, M Jones, B Sheng, M Wahlström, A Yeo - 2016 - core.ac.uk
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 …
polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in …
[PDF][PDF] Chinese Postman Problem on Edge-Colored Multigraphs
G Gutin, M Jones, B Sheng, M Wahlström, A Yeo - 2016 - pure.royalholloway.ac.uk
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 …
polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in …