Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Gokhale, Prashant"'
Autor:
Biedl, Therese, Gokhale, Prashant
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 can be reduced to a problem of testing (repeatedly) whether a vertical
Externí odkaz:
http://arxiv.org/abs/2406.03632
Given a set $P$ of points in the plane, a point burning process is a discrete time process to burn all the points of $P$ where fires must be initiated at the given points. Specifically, the point burning process starts with a single burnt point from
Externí odkaz:
http://arxiv.org/abs/2209.13024