How much semigroup structure is needed to encode graphs ? (Q3735947)
From MaRDI portal
!
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 3968912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How much semigroup structure is needed to encode graphs ? |
scientific article; zbMATH DE number 3968912 |
Statements
How much semigroup structure is needed to encode graphs ? (English)
0 references
1986
0 references
isomorphism complete
0 references
polynomial time isomorphism algorithm
0 references
critical varieties of finite semigroups
0 references
0.7845675945281982
0 references
0.7446282505989075
0 references
0.7299734354019165
0 references
0.7278191447257996
0 references
0.7243788242340088
0 references
