SNUCSE-CTA / DAF
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together
☆66Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for DAF
- Graph Analysis Library for directed and undirected simple graph☆22Updated last year
- ☆13Updated last year
- INFINEL: An efficient GPU-based processing method for unpredictable large output graph queries [PPoPP'24]☆10Updated 9 months ago
- ☆15Updated 7 months ago
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆10Updated 2 years ago
- ☆31Updated last year
- Undergraduate Operating Systems course (2019 fall)☆17Updated 4 years ago
- ☆13Updated 2 weeks ago
- ☆75Updated last month
- ☆185Updated 7 months ago
- ☆15Updated 8 months ago
- ☆28Updated 3 years ago
- Space-efficient graph data converter☆13Updated 2 years ago
- 고인물들은 무엇을 아는가☆137Updated 4 years ago
- This is an auto-generated repository from the whole source code, without reference solution source codes.☆135Updated 5 months ago
- ☆12Updated 3 years ago
- ☆20Updated last year
- A subgraph enumeration framework☆13Updated 7 years ago
- LaTeX 양식 : R&E, 졸업논문, beamer 등등 - 컴파일된 결과 pdf파일 미포함☆65Updated 8 months ago
- ☆11Updated 10 months ago
- Happy Campus Life☆229Updated 3 years ago
- 소프트웨어 개발의 원리와 실습☆27Updated 3 years ago
- ☆100Updated last year
- 2017F Programming Language Homework Checker☆30Updated 6 years ago
- ☆22Updated 5 years ago
- ☆25Updated 5 years ago