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...
Saved in:
Published in | Ji suan ji ke xue Vol. 49; no. 12; pp. 283 - 292 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | Chinese |
Published |
Chongqing
Guojia Kexue Jishu Bu
01.12.2022
Editorial office of Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!