Pages that link to "Item:Q3304141"
From MaRDI portal
The following pages link to A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width (Q3304141):
Displaying 14 items.
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Mim-width. I. Induced path problems (Q2174563) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- (Q3779759) (← links)
- (Q5009468) (← links)
- (Q5009483) (← links)
- (Q5009589) (← links)
- (Q5075752) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
