The Steiner cycle and path cover problem on interval graphs
From MaRDI portal
Publication:2075469
Recommendations
Cites work
- Abusing the Tutte matrix: an algebraic instance compression for the \(K\)-set-cycle problem
- An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
- Approximability of the minimum Steiner cycle problem
- Computing directed Steiner path covers for directed co-graphs (extended abstract)
- Deferred-query: An efficient approach for some problems on interval graphs
- Exact solutions for the Steiner path cover problem on special graph classes
- Finding Hamiltonian circuits in interval graphs
- Linear algorithm for optimal path cover problem on interval graphs
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
- The Steiner cycle polytope
Cited in
(4)
This page was built for publication: The Steiner cycle and path cover problem on interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2075469)