The g-trie is a data structure to count occurrences of subgraphs on larger graphs, determining if they are network motifs.
☆10Sep 29, 2015Updated 10 years ago
Alternatives and similar repositories for gtrieScanner
Users that are interested in gtrieScanner are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- CancerMIRNome - an interactive analysis and visualization database for miRNome profiles of human cancer☆12Aug 9, 2024Updated 2 years ago
- unofficial repository of nauty and traces, the graph automorphism tools. Check branches for other versions, the official release system i…☆25Jul 18, 2025Updated last year
- ☆20May 12, 2026Updated 3 months ago
- 华为软件精英挑战赛2019,实时计算全图路况,每辆车在每个时刻(或隔几个时刻)根据自身信息生成自己的权重矩阵,利用SPFA算法动态规划路径☆10Apr 14, 2019Updated 7 years ago
- Parallel version of HIT☆16Apr 11, 2015Updated 11 years ago
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- The official implementation of ''Can Graph Neural Networks Count Substructures?'' NeurIPS 2020☆36Mar 3, 2021Updated 5 years ago
- WebGraph is a framework for graph compression.☆18Jun 22, 2025Updated last year
- 2019华为软件精英挑战赛☆10Apr 15, 2019Updated 7 years ago
- Unit website☆14Aug 6, 2026Updated 3 weeks ago
- Kavosh: a new algorithm for finding network motifs