Pages that link to "Item:Q4699157"
From MaRDI portal
The following pages link to A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem (Q4699157):
Displaying 12 items.
- A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Approximating power node-deletion problems (Q6057334) (← links)
- (Q6062162) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
- Minimization and parameterized variants of vertex partition problems on graphs (Q6087212) (← links)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
- Spin Glass approach to the feedback vertex set problem (Q6176705) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
- Approximating power node-deletion problems (Q6593676) (← links)
- Connected feedback vertex set on AT-free graphs (Q6658085) (← links)
- A constant-factor approximation for weighted bond cover (Q6671673) (← links)