supported by the National Natural Science Foundation of China(Grant Nos.61932004 and 62072205).
Reachability query plays a vital role in many graph analysis tasks.Previous researches proposed many methods to efficiently answer reachability queries between vertex pairs.Since many real graphs are labeled graph,it ...
Acknowledgements This work was supported by the National Natural Science Foundation of China (Grant No. 61174094), and the Tianjin Natural Science Foundation of China under (14JCYBJC18700 and 13JCY- BJC17400).
This paper investigates the transition function and the reachability conditions of finite automata by using a semitensor product of matrices, which is a new powerful matrix analysis tool. The states and input symbols ...
It is increasingly common to find graphs in which edges are of different types, indicating a variety of relation- ships. For such graphs we propose a class of reachability queries and a class of graph patterns, in whi...