1st High Performance Graph Mining workshop, Sydney, 10 August 2015

Sumari

  • Fast, exact graph diameter computation with vertex programming 

    Pennycuff, Corey; Weninger, Tim (2015)
    Text en actes de congrés
    Accés obert
    In graph theory the diameter is an important topological metric for understanding size and density of a graph. Unfortunately, the graph diameter is computationally di cult to measure for even moderately-sized graphs, ...

  • Parallel k nearest neighbor graph construction using tree-based data structures 

    Rajani, Nazneen; McArdle, Kate; Dhillon, Inderjit S. (2015)
    Text en actes de congrés
    Accés obert
    Construction of a nearest neighbor graph is often a neces- sary step in many machine learning applications. However, constructing such a graph is computationally expensive, es- pecially when the data is high dimensional. ...

  • GraSP: distributed streaming graph partitioning 

    Battaglino, Casey; Pienta, Pienta; Vuduc, Richard (2015)
    Text en actes de congrés
    Accés obert
    This paper presents a distributed, streaming graph parti- tioner, Graph Streaming Partitioner (GraSP), which makes partition decisions as each vertex is read from memory, sim- ulating an online algorithm that must process ...