Search Results for author:
Found 2 papers, 1 papers with code
Computing Graph Descriptors on Edge Streams
Operating on edge streams allows us to avoid storing the entire graph in memory, and controlling the sample size enables us to keep the runtime of our algorithms within desired bounds.
Estimating Descriptors for Large Graphs
State-of-the-art algorithms for computing descriptors require the entire graph to be in memory, entailing a huge memory footprint, and thus do not scale well to increasing sizes of real-world networks.
Databases
Cannot find the paper you are looking for? You can
Submit a new open access paper.
