3 citations · 10 across the 17 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DM2020
A Linear Time Algorithm for Computing the Eternal Vertex Cover Number of Cactus Graphs
Jasine Babu, Veena Prabhakaran, Arko Sharma
The eternal vertex cover problem is a dynamic variant of the classical vertex cover problem. It is NP-hard to compute the eternal vertex cover number of graphs and known algorithmi…
cs.DS2020
A Note on Arc-Disjoint Cycles in Bipartite Tournaments
Jasine Babu, Ajay Saju Jacob, R. Krithika +1
We show that for each non-negative integer k, every bipartite tournament either contains k arc-disjoint cycles or has a feedback arc set of size at most 7(k - 1).
math.CO2020
An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter
Jasine Babu, Deepu Benson, Deepak Rajendraprasad +1
An orientation of an undirected graph is an assignment of exactly one direction to each edge of . The oriented diameter of a graph is the smallest diameter among all the…