3-connected Planar Graph Isomorphism is in Log-space

Simple item page
dc.creatorDatta, Samir
dc.creatorLimaye, Nutan
dc.creatorNimbhorkar, Prajakta
dc.date2008-06-05
dc.date.accessioned2026-07-07T10:02:40Z
dc.date.available2026-07-07T10:02:40Z
dc.descriptionWe show that the isomorphism of 3-connected planar graphs can be decided in deterministic log-space. This improves the previously known bound UL$\cap$coUL of Thierauf and Wagner.
dc.identifierhttps://arxiv.org/abs/0806.1041
dc.identifierhttp://arxiv.org/abs/0806.1041
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/169054
dc.subjectComputational Complexity
dc.title3-connected Planar Graph Isomorphism is in Log-space
dc.typetext

Files

Collections

arXiv