We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
We introduce an algorithm for MinA extraction in EL based on bidirectional reachability. We obtain a significant reduction in the size of modules extracted at almost no additional...