Ankit Abhinav

collaborators

2 papers

cs.DM2025

Towards Transitive-free Digraphs

Ankit Abhinav, Satyabrata Jana, Abhishek Sahu

In a digraph $D$ , an arc $e = (x, y)$ in $D$ is considered transitive if there is a path from $x$ to $y$ in $D - e$ . A digraph is transitive-free if it does not contain any transitive…

cs.DS2022

Parameterized Complexity of Graph Partitioning into Connected Clusters

Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik +1

Given an undirected graph $G$ and $q$ integers $n_{1}, n_{2}, n_{3}, \dots, n_{q}$ , balanced connected $q$ -partition problem ( $B C P_{q}$ ) asks whether there exists a partition of the vertex se…