Peter Gartland

activity

20182024

_{k}

-Free Graphs in Quasi-Polynomial Time

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

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2020

Finding large induced sparse subgraphs in $C_{> t}$ -free graphs in quasipolynomial time

Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk +2

For an integer $t$ , a graph $G$ is called {\em{ $C_{> t}$ -free}} if $G$ does not contain any induced cycle on more than~ $t$ vertices. We prove the following statement: for every pair…

cs.DS2020★ 5 cited

Independent Set on P $_{k}$ -Free Graphs in Quasi-Polynomial Time

Peter Gartland, Daniel Lokshtanov

We present an algorithm that takes as input a graph $G$ with weights on the vertices, and computes a maximum weight independent set $S$ of $G$ . If the input graph $G$ excludes a pa…

Finding large induced sparse subgraphs in C>t​-free graphs in quasipolynomial time

Independent Set on Pk​-Free Graphs in Quasi-Polynomial Time

Finding large induced sparse subgraphs in $C_{> t}$ -free graphs in quasipolynomial time

Independent Set on P $_{k}$ -Free Graphs in Quasi-Polynomial Time