Feedback vertex set on cocomparability graphs
From MaRDI portal
(Redirected from Publication:4894873)
Recommendations
- Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
- Feedback vertex set on planar graphs
- Feedback vertex sets on restricted bipartite graphs
- Feedback vertex sets and cyclically reducible graphs
- Feedback vertex set in mixed graphs
- Feedback Vertex Sets on Tree Convex Bipartite Graphs
- Feedback vertex set on graphs of low cliquewidth
- Feedback vertex sets in cubic multigraphs
- Feedback vertex set on graphs of low clique-width
- Feedback Vertex Sets in Rotator Graphs
Cited in
(14)- On the feedback vertex set problem in permutation graphs
- Minimum feedback vertex set and acyclic coloring.
- Solving the feedback vertex set problem on undirected graphs
- Happy set problem on subclasses of co-comparability graphs
- Feedback vertex sets in cubic multigraphs
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
- Feedback vertex set on Hamiltonian graphs
- Minimum weight feedback vertex sets in circle n-gon graphs and circle trapezoid graphs
- Feedback Vertex Sets on Tree Convex Bipartite Graphs
- An algorithm to find a minimum feedback vertex set of an interval graph
- A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
- Efficient algorithm for minimum feedback vertex set problem on trapezoid graphs
- Happy set problem on subclasses of co-comparability graphs
- Minimum weight feedback vertex sets in circle graphs
This page was built for publication: Feedback vertex set on cocomparability graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894873)
