Analysis and Management to Hash-Based Graph and Rank
2019
We study the problem of how to calculate the importance score for each node in a graph where data are denoted as hash codes. Previous work has shown how to acquire scores in a directed graph. However, never has a scheme analyzed and managed the graph whose nodes consist of hash codes. We extend the past methods and design the undirected hash-based graph and rank algorithm. In addition, we present addition and deletion strategies on our graph and rank.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
15
References
3
Citations
NaN
KQI