Pith. sign in

REVIEW

A survey of parameterized algorithms and the complexity of edge modification

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2001.06867 v2 pith:JN3UWJUX submitted 2020-01-19 cs.DS cs.CC

Christophe Crespelle , P{aa}l Gr{o}n{aa}s Drange , Fedor V. Fomin , Petr A. Golovach This is my paper · ORCID
classification cs.DScs.CC
keywords modificationalgorithmsedgegraphparameterizedproblemssurveyadjacencies
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools