Pages that link to "Item:Q1003668"
From MaRDI portal
The following pages link to Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668):
Displaying 10 items.
- Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
- Lane covering with partner bounds in collaborative truckload transportation procurement (Q1652017) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- Postman problems on series-parallel mixed graphs (Q2183202) (← links)
- Series-parallel graphs are windy postman perfect (Q2476276) (← links)
- Covering partially directed graphs with directed paths (Q2497477) (← links)
- The mixed Chinese postman problem parameterized by pathwidth and treedepth (Q2835842) (← links)
- (Q3216698) (← links)
- Structural Parameterizations of the Mixed Chinese Postman Problem (Q3452829) (← links)
- Cycle-connected mixed graphs and related problems (Q5918609) (← links)