Parameterized Directed $$k$$-Chinese Postman Problem and $$k$$ Arc-Disjoint Cycles Problem on Euler Digraphs
From MaRDI portal
Publication:2945194
DOI10.1007/978-3-319-12340-0_21zbMath1417.90144arXiv1402.2137OpenAlexW1815974477MaRDI QIDQ2945194
No author found.
Publication date: 9 September 2015
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.2137
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
This page was built for publication: Parameterized Directed $$k$$-Chinese Postman Problem and $$k$$ Arc-Disjoint Cycles Problem on Euler Digraphs
