The isomorphism problem for planar 3-connected graphs is in unambiguous logspace

From MaRDI portal
Publication:1959391

DOI10.1007/s00224-009-9188-4zbMath1203.05104OpenAlexW2019136393MaRDI QIDQ1959391

Thomas Thierauf, Fabian Wagner

Publication date: 6 October 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2008/1327/




Related Items (4)



Cites Work


This page was built for publication: The isomorphism problem for planar 3-connected graphs is in unambiguous logspace