Now showing items 1-1 of 1

    • Quick but odd growth of cacti 

      Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket (Dagstuhl Publishing, 2015)
      Let F be a family of graphs. Given an input graph G and a positive integer k, testing whether G has a k-sized subset of vertices S, such that G\S belongs to F, is a prototype vertex deletion problem. These type of problems ...
      Conference object