On the parallel parameterized complexity of the graph isomorphism problem

DOI10.1007/978-3-319-75172-6_22zbMath1498.68200arXiv1711.08885OpenAlexW2769447034MaRDI QIDQ1641130

I. Vinod Reddy, Bireswar Das, Murali Krishna Enduri

Publication date: 15 June 2018

Full work available at URL: https://arxiv.org/abs/1711.08885

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

On the Descriptive Complexity of Color Coding

This page was built for publication: On the parallel parameterized complexity of the graph isomorphism problem