1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
Chetan Gupta, Raghunath Tewari, Vimal Raj Sharma
We show that given an embedding of an genus bipartite graph, one can construct an edge weight function in logarithmic space, with respect to which the minimum weight pe…
Lossy Catalytic Computation
Chetan Gupta, Rahul Jain, Vimal Raj Sharma +1
A catalytic Turing machine is a variant of a Turing machine in which there exists an auxiliary tape in addition to the input tape and the work tape. This auxiliary tape is initiall…
Reachability and Matching in Single Crossing Minor Free Graphs
Samir Datta, Chetan Gupta, Rahul Jain +3
We show that for each single crossing graph , a polynomially bounded weight function for all -minor free graphs can be constructed in Logspace such that it gives nonzero…
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs
Chetan Gupta, Rahul Jain, Raghunath Tewari
A graph separator is a subset of vertices of a graph whose removal divides the graph into small components. Computing small graph separators for various classes of graphs is an imp…