Non User
  Index: > A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Business
Non User
 Industries Finance Tax

Home > PQ tree


Trees (structure)

A PQ tree is a special kind of tree data structure. It is a rooted, labeled tree, with non- leaf nodes labelled P or Q. A P node has at least two children, and a Q node has at least three children.

Reference

K.S. Booth and G.S. Lueker. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ- Tree Algorithms. Journal of Computer and Systems Sciences , 13:335-379, 1976.



Politics Business Finance
PQ Tree Children Node Structure Property

Topics: PQ Tree Children Node Structure Property Booth Consecutive...

PQ treeTrees (structure) A PQ tree is a special kind of tree data structure. It is a rooted, labeled tree, with non- leaf nodes labelled P or Q. A P node has at least two children, and a Q node has at least three children. Reference K. Booth and G. Testing for tPq numberA pq number is a number that is the product of two primes. 


Non User