Utilizing constraint satisfaction techniques for efficient graph pattern matching (Q2728862)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1629832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Utilizing constraint satisfaction techniques for efficient graph pattern matching |
scientific article; zbMATH DE number 1629832 |
Statements
6 November 2001
0 references
graph matching
0 references
subgraph homomorphism problem
0 references
constraint satisfaction problem
0 references
0.7931990623474121
0 references
0.7556241154670715
0 references
0.750902533531189
0 references
0.7458983659744263
0 references
0.7446532249450684
0 references
Utilizing constraint satisfaction techniques for efficient graph pattern matching (English)
0 references
