Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial-time algorithm for isomorphism of graphs with clique-width at most three |
scientific article; zbMATH DE number 6622019
- Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time algorithm for isomorphism of graphs with clique-width at most three |
scientific article; zbMATH DE number 6622019 |
|
Statements
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (English)
0 references
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three (English)
0 references
8 April 2020
0 references
2 September 2016
0 references
clique-width
0 references
graph isomorphism
0 references
algorithm
0 references
0 references
0 references
1.0000001
0 references
0.9152179
0 references
0.9044193
0 references
0.90115774
0 references
0.89777267
0 references
0.89105177
0 references
0.8792235
0 references
