Pages that link to "Item:Q340562"
From MaRDI portal
The following pages link to Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562):
Displaying 6 items.
- Postman problems on series-parallel mixed graphs (Q2183202) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges (Q2672432) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)
