Efficiently Answering Minimum Reachable Label Set Queries in Edge-Labeled Graphs-Reference-Cited by-同舟云学术

Efficiently Answering Minimum Reachable Label Set Queries in Edge-Labeled Graphs

Published:2022-10-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 31st ACM International Conference on Information & Knowledge Management
language:
Short-container-title:

Author:

Wu Yanping¹,Sun Renjie²,Chen Chen³,Wang Xiaoyang⁴,Fu Xianming⁵

Affiliation:

1. University of Technology Sydney, Sydney, NSW, Australia

2. East China Normal University, Shanghai, China

3. University of Wollongong, Wollongong, Australia

4. University of New South Wales, Sydney, NSW, Australia

5. Zhejiang Gongshang University, Hangzhou, China

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3511808.3557593

Reference15 articles.

1. Efficiently answering reachability and path queries on temporal bipartite graphs

2. Computing label-constraint reachability in graph databases

3. Richard M Karp . 1972. Reducibility among combinatorial problems . In Complexity of computer computations . Springer , 85--103. Richard M Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. Springer, 85--103.

4. Efficient reachability queries in multi-relation graph: An index-based approach

5. Answering billion-scale label-constrained reachability queries within microsecond

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Balanced Hop-Constrained Path Enumeration in Signed Directed Graphs;Lecture Notes in Computer Science;2023-11-07

2. Efficient Maximum Relative Fair Clique Computation in Attributed Graphs;Lecture Notes in Computer Science;2023-11-07