Kehong Zhang, Keqiu Li
Computer Systems Science and Engineering, Vol.33, No.2, pp. 71-85, 2018, DOI:10.32604/csse.2018.33.071
Abstract Today, many applications such as social network and biological network develop rapidly,the graph data will be expanded constantly on a large scale. Some
classic methods can not effectively solve this scale of the graph data. In the reachability query, many technologies such as N-Hop, tree, interval labels,
uncertain graph processing are emerging, they also solve a lot of questions about reachability query of graph. But, these methods have not put forward
the effective solution for the new issues of the multiattribute constraints reachability on directed graph. In this paper, TCRQDG algorithm effectively solves
this new More >
Login
Register
