A similarity measure for graphs with low computational complexity (Q861127): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.04.006 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2166251704 / rank | |||
Normal rank |
Revision as of 21:03, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A similarity measure for graphs with low computational complexity |
scientific article |
Statements
A similarity measure for graphs with low computational complexity (English)
0 references
9 January 2007
0 references
A class of generalized trees is defined that includes directed, rooted trees. Using this class, a measure of structural similarity based on optimal alignment of property strings of these graphs is developed, and an efficient dynamic programming strategy is given. In this way, similarity measures using isomorphism of tree structures are extended to the richer class of generalized trees while maintaining efficient computation.
0 references
graph similarity
0 references
generalized tree
0 references
isomorphism
0 references