From few components to an Eulerian graph by adding ARCS
From MaRDI portal
Recommendations
Cites work
- A fundamental problem in vehicle routing
- A new view on rural postman based on Eulerian extension and matching
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
- Approximation Algorithms for Some Postman Problems
- Arc Routing Problems, Part II: The Rural Postman Problem
- Efficient algorithms for Eulerian extension
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Incompressibility through Colors and IDs
- On Eulerian extensions and their application to no-wait flowshop scheduling
- On general routing problems
- On general routing problems: Comments
- On problems without polynomial kernels
Cited in
(14)- A new view on rural postman based on Eulerian extension and matching
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
- scientific article; zbMATH DE number 6379051 (Why is no real title available?)
- Efficient algorithms for Eulerian extension
- Rural postman parameterized by the number of components of required edges
- Parameterized complexity of \(k\)-Chinese postman problem
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
- Efficient algorithms for Eulerian extension and rural Postman
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- On approximate data reduction for the Rural Postman Problem: Theory and experiments
- A survey of parameterized algorithms and the complexity of edge modification
- An updated annotated bibliography on arc routing problems
- Weighted Eulerian extensions of random graphs
This page was built for publication: From few components to an Eulerian graph by adding ARCS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104786)
