Seminar • Algorithms and Complexity • Finding Maximum Matchings in RDV Graphs Efficiently

Please note: This seminar will take place in DC 2306 and online.

Prashant Gokhale, PhD candidate
David R. Cheriton School of Computer Science

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 segment intersects one of a dynamically changing set of horizontal segments, which in turn reduces to an orthogonal ray shooting query. Using a suitable data structure, we can therefore find a maximum matching in O(n log n) time (presuming a linear-sized representation of the graph is given), i.e., without even looking at all edges. 

To attend this seminar in person, please go to DC 2306. You can also attend virtually using Zoom