A cubic algorithm for the directed Eulerian subgraph problem
From MaRDI portal
Recommendations
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
- On the connected spanning cubic subgraph problem
- Pathwidth of cubic graphs and exact algorithms
- TSP on cubic and subcubic graphs
- Algorithm Theory - SWAT 2004
- An Improved Exact Algorithm for Cubic Graph TSP
- An algorithm for optimal acyclic edge-colouring of cubic graphs
- A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
Cites work
- scientific article; zbMATH DE number 3737730 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- On finding spanning eulerian subgraphs
- On multiple steiner subgraph problems
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
- Topology of series-parallel networks
Cited in
(3)
This page was built for publication: A cubic algorithm for the directed Eulerian subgraph problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q806684)
