A comparison of three maximum common subgraph algorithms on a large database of labeled graphs (Q4450798)
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 2043361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparison of three maximum common subgraph algorithms on a large database of labeled graphs |
scientific article; zbMATH DE number 2043361 |
Statements
16 February 2004
0 references
0.9587756991386414
0 references
0.9086560606956482
0 references
0.8349021673202515
0 references
A comparison of three maximum common subgraph algorithms on a large database of labeled graphs (English)
0 references