An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (Q360469)
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: An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants |
scientific article; zbMATH DE number 6201742
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants |
scientific article; zbMATH DE number 6201742 |
Statements
An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (English)
0 references
27 August 2013
0 references
graph isomorphism
0 references
graph measures
0 references
graph topology
0 references
uniqueness
0 references
0 references
0.7925382256507874
0 references
0.7830196022987366
0 references
0.7636873126029968
0 references
0.7556203007698059
0 references
0.7554620504379272
0 references
