Pål Grønås Drange

most citedA Polynomial Kernel for Trivially Perfect Editing

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2014★ 2 cited

A Polynomial Kernel for Trivially Perfect Editing

Pål Grønås Drange, Michał Pilipczuk

We give a kernel with $O (k^{7})$ vertices for Trivially Perfect Editing, the problem of adding or removing at most $k$ edges in order to make a given graph trivially perfect. This an…

cs.DS2014

On the Computational Complexity of Vertex Integrity and Component Order Connectivity

Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof

The Weighted Vertex Integrity (wVI) problem takes as input an $n$ -vertex graph $G$ , a weight function $w : V (G) \to N$ , and an integer $p$ . The task is to decide if there exis…