tlooto
Sign up
Computer ScienceMathematics

Querying subgraph sets with g-tries

P. Ribeiro, Fernando M A Silva

2012.5.20Unknown journal

DOI: 10.1145/2304536.2304541

tlooto Summary

An universal methodology for finding all the occurrences of a given set of subgraphs in one single larger graph using g-tries, a data structure specialized in dealing with subgraph sets.

Abstract

Abstract is not available.

Citation format

RIBEIRO, P.; SILVA, Fernando M A. Querying subgraph sets with g-tries. 2012.