A graph distance metric combining maximum common subgraph and minimum common supergraph (Q4795075)
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 1872571
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A graph distance metric combining maximum common subgraph and minimum common supergraph |
scientific article; zbMATH DE number 1872571 |
Statements
A graph distance metric combining maximum common subgraph and minimum common supergraph (English)
0 references
20 February 2003
0 references
optimal graph matching
0 references
error-correcting graph matching
0 references
attributed relational graph
0 references
graph edit distance
0 references
subgraph isomorphism
0 references
maximum common subgraph
0 references
minimum common super
0 references
0.8490633368492126
0 references
0.8366090059280396
0 references
0.8091002106666565
0 references
0.7924456596374512
0 references
