Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
90
Voted
STACS
2007
Springer
95
views
Theoretical Computer Science
»
more
STACS 2007
»
Planar Graphs: Logical Complexity and Parallel Isomorphism Tests
15 years 9 months ago
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
more »
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)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision