Pages that link to "Item:Q3104786"
From MaRDI portal
The following pages link to From Few Components to an Eulerian Graph by Adding Arcs (Q3104786):
Displaying 11 items.
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- (Q2933086) (← links)
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks (Q5056047) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)
