On the parallel parameterized complexity of the graph isomorphism problem

Show simple item record

dc.contributor.author Das, Bireswar
dc.contributor.author Enduri, Murali Krishna
dc.contributor.author Reddy, I. Vinod
dc.contributor.other 12th International Conference on Algorithms and Computation (WALCOM 2018)
dc.coverage.spatial Dhaka, BD.
dc.date.accessioned 2018-03-23T10:44:59Z
dc.date.available 2018-03-23T10:44:59Z
dc.date.issued 2018-03-03
dc.identifier.citation Das, Bireswar; Enduri, Murali Krishna and Reddy, I. Vinod, "On the parallel parameterized complexity of the graph isomorphism problem", in the 12th International Conference on Algorithms and Computation (WALCOM 2018), Dhaka, BD, Mar. 3-5, 2018. en_US
dc.identifier.uri https://repository.iitgn.ac.in/handle/123456789/3547
dc.description.statementofresponsibility by Bireswar Das, Murali Krishna Enduri and Vinod I. Reddy
dc.language.iso en en_US
dc.title On the parallel parameterized complexity of the graph isomorphism problem en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Digital Repository


Browse

My Account