| dc.contributor.author |
Das, Bireswar |
|
| dc.contributor.author |
Enduri, Murali Krishna |
|
| dc.contributor.author |
Reddy, I. Vinod |
|
| dc.date.accessioned |
2015-03-05T07:33:39Z |
|
| dc.date.available |
2015-03-05T07:33:39Z |
|
| dc.date.issued |
2015-02 |
|
| dc.identifier.citation |
Das, Bireswar; Enduri, Murali Krishna and Reddy, I. Vinod, “Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs", in WALCOM: Algorithms and Computation, DOI: 10.1007/978-3-319-15612-5_30, Cham: Springer International Publishing, 2015, pp. 329-334, ISBN: 978-3-319-15611-8. |
en_US |
| dc.identifier.isbn |
978-3-319-15611-8 |
|
| dc.identifier.uri |
http://dx.doi.org/10.1007/978-3-319-15612-5_30 |
|
| dc.identifier.uri |
https://repository.iitgn.ac.in/handle/123456789/1631 |
|
| dc.description.abstract |
We give a deterministic logspace algorithm for the graph isomorphism problem for graphs with bounded tree-depth. We also show that the graph isomorphism problem is fixed parameter tractable for a related parameterized graph class where the graph parameter is the length of the longest cycle. |
en_US |
| dc.description.statementofresponsibility |
by Bireswar Das, Murali Krishna, Enduri, and I. Vinod Reddy |
|
| dc.format.extent |
pp 329-334 |
|
| dc.language.iso |
en |
en_US |
| dc.publisher |
Springer |
en_US |
| dc.subject |
Algorithms |
en_US |
| dc.subject |
Computer Graphics |
en_US |
| dc.subject |
Discrete Mathematics in Computer Science |
en_US |
| dc.title |
Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs |
en_US |
| dc.type |
Book chapter |
en_US |