Sciweavers

SODA
2012
ACM
268views Algorithms» more  SODA 2012»
12 years 1 months ago
Analyzing graph structure via linear measurements
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...
Kook Jin Ahn, Sudipto Guha, Andrew McGregor
DLOG
2011
13 years 3 months ago
Bidirectional Reachability-Based Modules
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...
Riku Nortje, Arina Britz, Thomas Andreas Meyer