An algorithm using length-r paths to approximate subgraph isomorphism (Q4421027): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-8655(02)00186-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029059958 / rank | |||
Normal rank | |||
Latest revision as of 10:46, 30 July 2024
scientific article; zbMATH DE number 1967167
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm using length-r paths to approximate subgraph isomorphism |
scientific article; zbMATH DE number 1967167 |
Statements
An algorithm using length-r paths to approximate subgraph isomorphism (English)
0 references
19 August 2003
0 references
Approximate graph matching
0 references
Subgraph isomorphism
0 references
Attributed relational graphs
0 references
