A graph is planar if and only if it can be drawn in the plane without crossings. 5 I give a detai... more A graph is planar if and only if it can be drawn in the plane without crossings. 5 I give a detailed exposition of a simple and efficient, yet poorly known algorithm for 6 planarity testing and embedding based on the left-right characterization of planarity.
A graph is planar if and only if it can be drawn in the plane without crossings. 5 I give a detai... more A graph is planar if and only if it can be drawn in the plane without crossings. 5 I give a detailed exposition of a simple and efficient, yet poorly known algorithm for 6 planarity testing and embedding based on the left-right characterization of planarity.
Uploads
Papers by Alex Pizarro