How much semigroup structure is needed to encode graphs ? (Q3735947): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Pavel Goralčík / rank | |||
| Property / author | |||
| Property / author: Václav Koubek / rank | |||
| Property / author | |||
| Property / author: Pavel Goralčík / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Václav Koubek / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1051/ita/1986200201911 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W31706177 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:23, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How much semigroup structure is needed to encode graphs ? |
scientific article |
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
