A simple linear time algorithm for embedding maximal planar graphs

Hermann Stamm-Wilbrandt
Tech. report IAI-TR-93-10, Rheinische Friedrich-Wilhelms-Univ. Bonn, Inst. f�r Informatik, Oct 1993
ftp://www.informatik.uni-bonn.de/pub/paper/tr/IAI-TR-93-10.ps.gz

Cites:

Planar orientations with low out-degree and compaction of adjacency matrices

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine