18 Feb
2013
18 Feb
'13
4:15 p.m.
you'll have an easier time drawing graph on paper thus verifying/denying planarity, than you will trying to code up planarity algorithm. It'll take <5 minutes. (Jeez.) [And the fraction of, e.g, N vertex planar graphs within N vertex graphs is asymptotically known... almost all graphs are nonplanar...]