| dc.contributor.author |
Das, Bireswar |
|
| dc.contributor.author |
Enduri, Murali Krishna |
|
| dc.contributor.author |
Reddy, I. Vinod |
|
| dc.date.accessioned |
2016-08-03T07:10:00Z |
|
| dc.date.available |
2016-08-03T07:10:00Z |
|
| dc.date.issued |
2016-07 |
|
| dc.identifier.citation |
Das, Bireswar; Enduri, Murali Krishna and Reddy, I. Vinod, “Polynomial-time algorithm for isomorphism of graphs with clique-width at most three", in Lecture Notes in Computer Science, DOI: 10.1007/978-3-319-42634-1_5, vol. 9797, Springer International Publishing, 2016, pp. 55-66, ISBN: 978-3-319-42633-4. |
en_US |
| dc.identifier.isbn |
978-3-319-42633-4 |
|
| dc.identifier.uri |
https://repository.iitgn.ac.in/handle/123456789/2400 |
|
| dc.identifier.uri |
http://dx.doi.org/10.1007/978-3-319-42634-1_5 |
|
| 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. We give a polynomial time graph isomorphism algorithm for graphs with clique-width at most three. Our work is independent of the work by Grohe and Schweitzer [17] showing that the isomorphism problem for graphs of bounded clique-width is polynomial time. |
en_US |
| dc.description.statementofresponsibility |
by Bireswar Das, Murali Krishna Enduri and I. Vinod Reddy |
|
| dc.format.extent |
pp 55-66 |
|
| dc.language.iso |
en_US |
en_US |
| dc.publisher |
Springer |
en_US |
| dc.title |
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three |
en_US |
| dc.type |
Book chapter |
en_US |