A simple recognition of maximal planar graphs

Authors:
Hiroshi Nagamochi;Takahisa Suzuki;Toshimasa Ishii
Affiliations:
Department of Information and Computer Sciences, Toyohashi University of Technology, Toyohashi, Aichi, 441-8580, Japan;Star Micronics Co., Ltd., 20-10, Nakayoshida, Shizuoka, 422-8654, Japan;Department of Information and Computer Sciences, Toyohashi University of Technology, Toyohashi, Aichi, 441-8580, Japan
Venue:
Information Processing Letters
Year:
2004

Citing 1
Cited 1

Efficient Planarity Testing

Journal of the ACM (JACM)

EvoArch: An evolutionary algorithm for architectural layout design

Computer-Aided Design

Quantified Score

Hi-index	0.89

Visualization

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.