Dynamic Complexity of Planar 3-Connected Graph Isomorphism

Jenish C. Mehta. Dynamic Complexity of Planar 3-Connected Graph Isomorphism. In Edward A. Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay K. Vereshchagin, editors, Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings. Volume 8476 of Lecture Notes in Computer Science, pages 273-286, Springer, 2014. [doi]

Abstract

Abstract is missing.