Showing cs.CGShow all
2 papers · 1 filter
cs.CG2024
Finding maximum matchings in RDV graphs efficiently
Therese Biedl, Prashant Gokhale
In this paper, we study the maximum matching problem in RDV graphs, i.e., graphs that are vertex-intersection graphs of downward paths in a rooted tree. We show that this problem c…
cs.CG2022
Improved and Generalized Algorithms for Burning a Planar Point Set
Prashant Gokhale, J. Mark Keil, Debajyoti Mondal
Given a set of points in the plane, a point burning process is a discrete time process to burn all the points of where fires must be initiated at the given points. Specific…