A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees

@inproceedings{Hsu2005ALT,
title={A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees},
author={Wen-Lian Hsu},
booktitle={COCOON},
year={2005}
}

In Shih & Hsu, a planarity test was introduced utilizing a data structure called PC-trees, generalized from PQ-trees. They illustrated that a PC-tree is more natural IN representing planar graphs. Their algorithm starts by constructing a depth-first-search tree and adds all back edges to a vertex one by one. A major feature in the S&H algorithm is that, at each iteration, at most two terminal nodes need to be computed and the unique tree path between these two nodes provides essentially the… CONTINUE READING