Name
Abstract | ||
|---|---|---|
How to measure SimRank similarity of all-pair vertices in a graph is a very important research topic which has a wide range of applications in many fields. However, computation of SimRank is costly in both time and space, making traditional computing methods failing to handle graph data of ever-growing size. |
Year | Venue | Field |
|---|---|---|
2018 | ICA3PP | Graph,Spark (mathematics),Vertex (geometry),Similarity computation,Computer science,Parallel computing,Spacetime,Theoretical computer science,SimRank,Computation |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
16 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xuan Huang | 1 | 21 | 6.70 |
| Xingkun Gao | 2 | 0 | 0.34 |
| jie | 3 | 5 | 2.12 |
| Gang-Shan Wu | 4 | 27 | 6.75 |