A graph distance metric combining maximum common subgraph and minimum common supergraph (Q4795075): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115926470 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-8655(01)00017-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071910845 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:17, 30 July 2024
scientific article; zbMATH DE number 1872571
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
