Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:59, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time algorithm for isomorphism of graphs with clique-width at most three |
scientific article |
Statements
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (English)
0 references
8 April 2020
0 references
clique-width
0 references
graph isomorphism
0 references
algorithm
0 references
