Now showing items 1-1 of 1

  • Fast, exact graph diameter computation with vertex programming 

    Pennycuff, Corey; Weninger, Tim (Barcelona Supercomputing Center, 2015)
    Conference report
    Open Access
    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, ...