Pages that link to "Item:Q2285053"
From MaRDI portal
The following pages link to Mim-width. II. The feedback vertex set problem (Q2285053):
Displaying 21 items.
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Feedback vertex set on graphs of low clique-width (Q1933648) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
- Mim-width. I. Induced path problems (Q2174563) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- Lower bounds on the mim-width of some graph classes (Q2413964) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width (Q3304141) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Recognizing Proper Tree-Graphs (Q6089652) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
