Efficient subgraph matching using topological node feature constraints (Q1677053): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: gSpan / rank | |||
Normal rank | |||
Revision as of 08:20, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient subgraph matching using topological node feature constraints |
scientific article |
Statements
Efficient subgraph matching using topological node feature constraints (English)
0 references
10 November 2017
0 references
graph matching
0 references
subgraph isomorphism
0 references
topological node features
0 references
