mlsanityData to 7 Oct 2026

A survey of parameterized algorithms and the complexity of edge modification

arXiv 2001.06867 ↗First posted 19 Jan 2020cs.DS cs.CCcited by 1

Not on the map. Why?

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 19 Jan 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.

  1. 2025ReFill: Reinforcement Learning for Fill-In Minimizationcited by 0