Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org THE ISOMORPHISM PROBLEM FOR PLANAR 3-CONNECTED GRAPHS IS IN UNAMBIGUOUS LOGSPACE THOMAS THIERAUF
Add to Reading List
Document Date: 2008-02-05 08:15:01
Open Document
File Size: 168,50 KB
Share Result on Facebook
Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org THE ISOMORPHISM PROBLEM FOR PLANAR 3-CONNECTED GRAPHS IS IN UNAMBIGUOUS LOGSPACE THOMAS THIERAUF