Title of article
Simpler Projective Plane Embedding
Author/Authors
Myrvold، نويسنده , , Wendy and Roth، نويسنده , , Jianping، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
4
From page
243
To page
246
Abstract
A projective plane is equivalent to a disk with antipodal points identified. A graph is projective planar if it can be drawn on the projective plane with no crossing edges. A linear time algorithm for projective planar embedding has been described by Mohar [9]. We provide a new approach that takes O(n2) time but is much easier to implement.
Keywords
graph algorithms , surface embedding , projective plane , forbidden minor , Obstruction , graph embedding
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2000
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452877
Link To Document