2
Given a graph G = (V, E) (a forest) stored in Elasticsearch and a set of requests R, where each request r in R can potentially match between 0 and V vertices in G, the task is to identify the "best" match for these requests. The goal is to mark the minimal subtrees within G that correspond to the...
