7 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.CC2008★ 2 cited
3-connected Planar Graph Isomorphism is in Log-space
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar
We show that the isomorphism of 3-connected planar graphs can be decided in deterministic log-space. This improves the previously known bound ULcoUL of Thierauf and Wagner.
cs.CC2008★ 7 cited
Longest paths in Planar DAGs in Unambiguous Logspace
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
We show via two different algorithms that finding the length of the longest path in planar directed acyclic graph (DAG) is in unambiguous logspace UL, and also in the complement cl…