Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Feng, Tan Yu"'
Publikováno v:
Jisuanji kexue, Vol 49, Iss 12, Pp 283-292 (2022)
The k-step reachability query processing on label-constrained graph is used to answer whether there is a path with a length not greater than k between two points and the labels on this path are in the specified label set.The k-step reachability query
Externí odkaz:
https://doaj.org/article/342da34d7a3348a484f37b403b878336
Publikováno v:
AIP Conference Proceedings; 2020, Vol. 2284 Issue 1, p1-6, 6p