most citedAnti-Path Cover on Sparse Graph Classes

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

collaborators

1 paper

cs.DS2016★ 2 cited

Anti-Path Cover on Sparse Graph Classes

Pavel Dvořák, Dušan Knop, Tomáš Masařík

We show that it is possible to use Bondy-Chvatal closure to design an FPT algorithm that decides whether or not it is possible to cover vertices of an input graph by at most k vert…