Postman problems on series-parallel mixed graphs
From MaRDI portal
Publication:2183202
Recommendations
Cites work
- scientific article; zbMATH DE number 1305467 (Why is no real title available?)
- A partial k-arboretum of graphs with bounded treewidth
- Approximation algorithms for a mixed postman problem with restrictions on the arcs
- Arc Routing Problems, Part II: The Rural Postman Problem
- Feasibility of the Mixed Postman Problem with Restrictions on the Edges
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Matching, Euler tours and the Chinese postman
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
- Odd Minimum Cut-Sets and b-Matchings
- On the complexity of edge traversing
- On the windy postman problem
- On the windy postman problem on Eulerian graphs
- Parameterized complexity of the k-arc Chinese postman problem
- SOFSEM 2005: Theory and Practice of Computer Science
- Series-parallel graphs are windy postman perfect
- The Chinese Postman Problem for Mixed Networks
- The complexity of arc routing problems
- The ellipsoid method and its consequences in combinatorial optimization
This page was built for publication: Postman problems on series-parallel mixed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183202)