Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3312272 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Modular decomposition and transitive orientation / rank | |||
Normal rank | |||
Latest revision as of 08:12, 22 July 2024
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 |
|---|---|---|---|
| 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
