Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

STACS
2007
Springer

favoriteEmaildiscussreport

95views Theoretical Computer Science» more STACS 2007»

Planar Graphs: Logical Complexity and Parallel Isomorphism Tests

13 years 10 months ago

Planar Graphs: Logical Complexity and Parallel Isomorphism Tests

Download www-i7.informatik.rwth-aachen.de

Oleg Verbitsky

Real-time Traffic

STACS 2007 | Theoretical Computer Science |

claim paper

Related Content

» On the Complexity of Matroid Isomorphism Problem

» On Graph Isomorphism for Restricted Graph Classes

» Logical complexity of graphs a survey

» CPlanarity of Extrovert Clustered Graphs

» Evasiveness of Subgraph Containment and Related Properties

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	STACS
Authors	Oleg Verbitsky

Comments (0)