%0 Journal Article %1 nagamochi04 %A Nagamochi, Hiroshi %A Suzuki, Takahisa %A Ishii, Toshimasa %D 2004 %J Information Processing Letters %K algorithm graph.theory maximally.planar planar %N 5 %P 223--226 %R 10.1016/j.ipl.2003.11.011 %T A Simple Recognition of Maximal Planar Graphs %V 89 %X In this paper, we consider the problem of determining whether a given graph is a maximal planar graph or not. We show that a simple linear time algorithm can be designed based on canonical orderings. Our algorithm needs no sophisticated data structure and is significantly easy to implement compared with the existing planarity testing algorithms.

@article{nagamochi04, abstract = {In this paper, we consider the problem of determining whether a given graph is a maximal planar graph or not. We show that a simple linear time algorithm can be designed based on canonical orderings. Our algorithm needs no sophisticated data structure and is significantly easy to implement compared with the existing planarity testing algorithms. }, added-at = {2015-06-29T07:37:38.000+0200}, author = {Nagamochi, Hiroshi and Suzuki, Takahisa and Ishii, Toshimasa}, biburl = {https://www.bibsonomy.org/bibtex/230ac563ca0ca09067ca86d7bdc25b37b/ytyoun}, doi = {10.1016/j.ipl.2003.11.011}, interhash = {4e94a87d9ae63f1c4c6e5b5aa0985b68}, intrahash = {30ac563ca0ca09067ca86d7bdc25b37b}, issn = {0020-0190}, journal = {Information Processing Letters }, keywords = {algorithm graph.theory maximally.planar planar}, number = 5, pages = {223--226}, timestamp = {2016-02-02T12:26:40.000+0100}, title = {A Simple Recognition of Maximal Planar Graphs }, volume = 89, year = 2004 }