Abstract
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu where they represent partial embeddings of planar graphs. PQ-trees were invented by Booth and Lueker to test the consecutive ones property in matrices. The original implementation of the PQ-tree algorithms by Booth and Lueker using nine templates in each bottom-up iteration is rather complicated. Also the complexity analysis is rather intricate. We give a very simple PC-tree algorithm with the following advantages: (1) it does not use any template; (2) it does all necessary operations at each iteration in one batch and does not involve the cumbersome bottom-up operation PC-trees can be used naturally to test the circular ones property in matrices. And the induced PQ-tree algorithm can considerably simplify Booth and Lueker’s modification of Lempel, Even and Cederbaum’s planarity test.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.S. Booth and G.S. Lueker, Testing of the Consecutive Ones Property, Interval graphs, and Graph Planarity Using PQ-Tree Algorithms, J. Comptr. Syst. Sci. 13,3 (1976), 335–379.
D.R. Fulkerson and O.A. Gross, Incidence Matrices and Interval Graphs, Pacific Journal of Math., (1965), 15:835–855.
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
P.N. Klein and J.H. Reif, An efficient parallel algorithm for planarity, J. of Computer and System Science 37, (1988), 190–246.
N. Korte and R.H. Möhring, An Incremental Linear-Time Algorithm for Recognizing Interval Graphs, SIAM J. Comput. 18, 1989, 68–81.
A. Lempel, S. Even and I. Cederbaum, An Algorithm for Planarity Testing of Graphs, Theory of Graphs, ed., P. Rosenstiehl, Gordon and Breach, New York, (1967), 215–232.
W.K. Shih and W.L. Hsu, Note A new planarity test, Theoretical Computer Science 223, (1999), 179–191.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsu, WL. (2001). PC-Trees vs. PQ-Trees. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_23
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive