In this paper, we study the maximum matching problem in RDV graphs, i.e., 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 horizontal segment intersects one of a dynamically changing set of vertical segments, which in turn reduces to a range minimum 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.
Biedl et al. (Mon,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: