Searching for "The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

THE ISOMORPHISM PROBLEM FOR PLANAR 3-CONNECTED GRAPHS IS IN UNAMBIGUOUS LOGSPACE
by Thomas Thierauf, Fabian Wagner — 802
… (Bordeaux), pp. 633-644 www.stacs-conf.org THE ISOMORPHISM PROBLEM FOR PLANAR 3-CONNECTED GRAPHS…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB