3 papers
cs.DS2019
A Brief Note on Single Source Fault Tolerant Reachability
Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh +1
Let be a directed graph with vertices and edges, and let be a designated source vertex. We consider the problem of single source reachability (SSR) from $s…
cs.DS2017
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra +2
Given a graph and a parameter , the Chordal Vertex Deletion (CVD) problem asks whether there exists a subset of size at most that hits all induced cycl…
cs.DS2017
Polylogarithmic Approximation Algorithms for Weighted--Deletion Problems
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra +2
For a family of graphs , the canonical Weighted Vertex Deletion problem is defined as follows: given an -vertex undirected graph and a weight function $w: V…