✦ LIBER ✦
The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace
✍ Scribed by Thomas Thierauf; Fabian Wagner
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 567 KB
- Volume
- 47
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.