.png){kind=icon}
Return
Graph distances using graph union
.png){kind=icon}
PRE
AI
DOI：10.1016/S0167-8655(01)00022-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An existing graph distance metric based on maximum common subgraph has been extended by a proposal to define the problem size with the union of the two graphs being measured, rather than the larger of the two graphs used in the existing metric. For some applications the graph distance measure is more appropriate if the graph union approach is used. This graph distance measure is shown to be a metric. (C) 2001 Elsevier Science B.V. All rights reserved.
Keywords:
subgraph isomorphism
graph distance
maximum common subgraph
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
8.0K
Citations:
1.6W
Organization
No organization information available
Cited Papers
Mineralogy and crystal chemistry of Mn, Fe, Co, Ni, and Cu in a deep-sea Pacific polymetallic nodule
OAAI
.png){kind=icon}
OAAIShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
View more