k-step Reachability Query Processing on Label-constrained Graph

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 processing on label-constrained graph is widely u...

Full description

Saved in:
Bibliographic Details
Published inJi suan ji ke xue Vol. 49; no. 12; pp. 283 - 292
Main Authors Du, Ming, Xing, Rui-ping, Zhou, Jun-feng, Tan, Yu-ting
Format Journal Article
LanguageChinese
Published Chongqing Guojia Kexue Jishu Bu 01.12.2022
Editorial office of Computer Science
Subjects
Online AccessGet full text

Cover

Loading…