Pages that link to "Item:Q286981"
From MaRDI portal
The following pages link to A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981):
Displaying 22 items.
- Feedback vertex set in hypercubes (Q294845) (← links)
- A feedback vertex set of 2-degenerate graphs (Q300250) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- Minimum feedback vertex sets in shuffle-based interconnection networks (Q1007599) (← links)
- Feedback vertex sets in star graphs (Q1029080) (← links)
- A linear time algorithm for the minimum weighted feedback vertex set on diamonds (Q1041719) (← links)
- Almost exact minimum feedback vertex set in meshes and butterflies (Q1129019) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- The integrity of a cubic graph (Q1827848) (← links)
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies. (Q1853082) (← links)
- Minimum feedback vertex set and acyclic coloring. (Q1853123) (← links)
- Solving the feedback vertex set problem on undirected graphs (Q1975362) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- Feedback vertex sets in mesh-based networks (Q2383604) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- Minimum Weighted Feedback Vertex Set on Diamonds (Q3439134) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
