# A survey of parameterized algorithms and the complexity of edge modification

arXiv: https://arxiv.org/abs/2001.06867 · HTML: https://mlsanity.com/paper/2001.06867/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 Jan 2020.

## Built on by (most cited first, 1 of 1)

- [ReFill: Reinforcement Learning for Fill-In Minimization](https://mlsanity.com/paper/2501.16130/) (2025)

## Abstract (arXiv)

The survey provides an overview of the developing area of parameterized algorithms for graph modification problems. We concentrate on edge modification problems, where the task is to change a small number of adjacencies in a graph in order to satisfy some required property.