Skip to main content

1 Result(s)

within Algorithm Analysis and Problem Complexity Remove this filter Data Storage Representation Remove this filter Sreenivas Gollapudi Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Sparse Cut Projections in Graph Streams

    Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with such graphs having billions of...

    Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy in Algorithms - ESA 2009 (2009)