Name
Abstract | ||
|---|---|---|
We 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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.4230/LIPIcs.FSTTCS.2008.1749 | foundations of software technology and theoretical computer science |
Keywords | DocType | Volume |
planar graph,computational complexity | Conference | abs/0806.1041 |
Citations | PageRank | References |
2 | 0.40 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Samir Datta | 1 | 200 | 19.82 |
| Nutan Limaye | 2 | 134 | 20.59 |
| Prajakta Nimbhorkar | 3 | 170 | 15.04 |