| dc.contributor.author |
Das, Bireswar |
|
| dc.contributor.author |
Enduri, Murali Krishna |
|
| dc.contributor.author |
Reddy, I. Vinod |
|
| dc.date.accessioned |
2015-06-26T11:02:46Z |
|
| dc.date.available |
2015-06-26T11:02:46Z |
|
| dc.date.issued |
2015-06 |
|
| dc.identifier.citation |
Das, Bireswar; Enduri, Murali Krishna and Reddy, I. Vinod, “Polynomial-time algorithm for Isomorphism of graphs with clique-width at most 3”, arXiv, Cornell University Library, DOI: arXiv:1506.01695, Jun. 2015. |
en_US |
| dc.identifier.uri |
https://repository.iitgn.ac.in/handle/123456789/1793 |
|
| dc.description.abstract |
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. While there are many results on the graph isomorphism problem for bounded tree-width graphs, very little is known about isomorphism of bounded clique-width graphs. We give the first polynomial-time graph isomorphism algorithm for graphs with clique-width at most 3. |
en_US |
| dc.description.statementofresponsibility |
by Enduri Das, Bireswar, Krishna Murali and I. Vinod Reddy |
|
| dc.language.iso |
en |
en_US |
| dc.publisher |
Cornell University Library |
en_US |
| dc.subject |
Computational Complexity |
en_US |
| dc.subject |
Isomorphism |
en_US |
| dc.title |
Polynomial-time algorithm for Isomorphism of graphs with clique-width at most 3 |
en_US |
| dc.type |
Preprint |
en_US |