Our research paper has been accepted to The Web Conference 2024. . ├─ framework.png ├─ get_sub_counts.py ├─ main.py ├─ README.md │ ├─ CTAug │ ├─ evaluate.py │ ├─ model.py │ ├─ preprocess.py │ ├─ utils ...
Abstract: Temporal-constraint subgraph matching has emerged as a significant challenge in the study of temporal graphs, which model dynamic relationships across various domains, such as social ...
A benchmark for subgraph matching but with type information (vertex and edge types). The primary goal of this benchmark is to test the query optimizer (join ordering, choosing between binary and n-ary ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback