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

First Page		Document Content
Date: 2008-02-05 08:15:01		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 Source URL: drops.dagstuhl.de Download Document from Source Website File Size: 168,50 KB Share Document on Facebook