Now showing items 1-3 of 3

    • Konduri, Pranav S
      The k-core of an undirected graph is the largest subgraph in which every vertex has a degree of at least some number k. Computing the k-core, also known as the k-core decomposition algorithm, has significant applications ...
    • Madhu, Vidith
      Recently, there has been a significant desire both within the scientific community and industry to write graph algorithms using linear algebraic operations. This leads to algorithms that can leverage many important algebraic ...
    • Pearce, Roger Allan (2013-12-05)
      Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage “Big Data” to answer next-generation scientific questions. New techniques are required to process large ...