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
7 Citations
21 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Lempel , S . Even and I . Cederbaum [ 1967 ] , An algorithm for planarity testing of graphs , Theory of Graphs

  • P. Rosenstiehl
  • IEEE Transactions On Computer - Aided Design
  • 1998

Planarity in linear time – Lecture Notes, Georgia Institute of Technology

  • R. Thomas
  • 1997
1 Excerpt

Finding maximal planar subgraphs in linear time," Lecture Notes in Computer Science 1004

  • W. L. Hsu
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…