Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558)
From MaRDI portal
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time algorithm for isomorphism of graphs with clique-width at most three |
No description defined |
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
