3-connected Planar Graph Isomorphism is in Log-space | fatcat!

by Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Marc Herbstritt

Cited By

References to this release by other works.

Read more about quality, completeness, and caveats in the fatcat guide.

Showing 1 - 6 of 6 references (in 61ms)
via fuzzy	Graph Isomorphism Restricted by Lists [article] Pavel Klavik, Dušan Knop, Peter Zeman 2016 pre-print version:v1 arXiv:1607.03918v1	web.archive.org [PDF]
via fuzzy	On the Complexity of Matroid Isomorphism Problem B. V. Raghavendra Rao, M. N. Jayalal Sarma 2010 Theory of Computing Systems doi:10.1007/s00224-010-9260-0
via fuzzy	A Log-space Algorithm for Canonization of Planar Graphs [article] Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner 2009 pre-print version:v2 arXiv:0809.2319v2	archive.org [PDF]
via fuzzy	Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner, Marc Herbstritt 2009 Foundations of Software Technology and Theoretical Computer Science doi:10.4230/lipics.fsttcs.2009.2314 dblp:conf/fsttcs/DattaNTW09	web.archive.org [PDF]
via fuzzy	Planar Graph Isomorphism is in Log-Space Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner 2009 Computational Complexity Conference doi:10.1109/ccc.2009.16 dblp:conf/coco/DattaLNTW09	web.archive.org [PDF]
via fuzzy	On the Complexity of Matroid Isomorphism Problem [article] Raghavendra Rao B.V., Jayalal M.N. Sarma 2008 pre-print version:v1 arXiv:0811.3859v1	web.archive.org [PDF]
JSON