Back to Results
First PageMeta Content
Morphisms / Graph coloring / Graph embedding / Planar graphs / Crossing number / Graph isomorphism problem / Neighbourhood / Chordal graph / Graph isomorphism / Graph theory / Mathematics / Topological graph theory


Graph Crossing Number and Isomorphism SPUR Final Paper, Summer 2012 Mark Velednitsky Mentor Adam Bouland Problem suggested by Adam Bouland, Jacob Fox MIT
Add to Reading List

Document Date: 2013-02-04 10:20:57

Open Document

File Size: 97,17 KB

Share Result on Facebook

IndustryTerm

bounded search tree / recursive algorithm / fixed-parameter tractable algorithm / planar graph isomorphism algorithm / computing / graph isomorphism algorithm / planar isomorphism algorithm / canonical labeling algorithm / bounded search trees / /

OperatingSystem

XP / /

Organization

MIT / /

Person

Arvind / V / Mark Velednitsky Mentor Adam Bouland / Jacob Fox / Adam Bouland / Jordan Blocks / /

Position

Professor / /

PublishedMedium

Theoretical Computer Science / Theory of Computing / /

Technology

ADAM / planar isomorphism algorithm / Linear Time Algorithm / second algorithm / graph isomorphism algorithm / canonical labeling algorithm / planar graph isomorphism algorithm / recursive algorithm / fixed-parameter tractable algorithm / /

SocialTag