Exact Learning of Multitrees and Almost-Trees Using Path Queries

Ramtin Afshar, Michael T. Goodrich

Given a directed graph, G=(V,E), a path query, path(u,v), returns whether there is a directed path from u to v in G, for u,v vertices in V. Given only V, exactly learning all the e…