Structural similarity of directed universal hierarchical graphs: a low computational complexity approach (Q990638)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Structural similarity of directed universal hierarchical graphs: a low computational complexity approach |
scientific article; zbMATH DE number 5777098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Structural similarity of directed universal hierarchical graphs: a low computational complexity approach |
scientific article; zbMATH DE number 5777098 |
Statements
Structural similarity of directed universal hierarchical graphs: a low computational complexity approach (English)
0 references
1 September 2010
0 references
structured objects
0 references
hierarchical models
0 references
graph classes
0 references
graph classification
0 references
graph similarity
0 references
complexity analysis
0 references
0 references
0.8437236547470093
0 references
0.8429402709007263
0 references
0.8115705847740173
0 references
0.7491364479064941
0 references
