Title | ||
---|---|---|
Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space. |
Year | Venue | Field |
---|---|---|
2014 | arXiv: Distributed, Parallel, and Cluster Computing | Discrete mathematics,Block graph,Mathematical optimization,Graph power,Computer science,Folded cube graph,Cubic graph,Distance-regular graph,Pathwidth,Butterfly graph,Lattice graph,Distributed computing |
DocType | Volume | Citations |
Journal | abs/1407.3144 | 0 |
PageRank | References | Authors |
0.34 | 11 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Matteo Ceccarello | 1 | 36 | 6.24 |
Andrea Pietracaprina | 2 | 131 | 16.33 |
Geppino Pucci | 3 | 443 | 50.49 |
Eli Upfal | 4 | 4310 | 743.13 |