Linear matching-time algorithm for the directed graph isomorphism problem (Q6487989)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7666537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear matching-time algorithm for the directed graph isomorphism problem |
scientific article; zbMATH DE number 7666537 |
Statements
Linear matching-time algorithm for the directed graph isomorphism problem (English)
0 references
21 March 2023
0 references
0.8276480436325073
0 references
0.7555631995201111
0 references
0.7555178999900818
0 references
0.7450476884841919
0 references
