2013•Unpublished venueRequires access
A fast algorithm for subgraph pattern matching on large labeled graphs
Matthew Saltz
Open publisher page 5 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Matthew Saltz
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Induced subgraph isomorphism problem, Subgraph isomorphism problem, Matching (statistics), Algorithm, Computer science, Combinatorics, Mathematics, Theoretical computer science