PQ tree

Known as: PQ-Tree 
A PQ tree is a tree-based data structure that represents a family of permutations on a set of elements, discovered and named by Kellogg S. Booth and… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this article, we define and study the new problem of S<scp>imultaneous</scp> PQ-O<scp>rdering</scp>. Its input consists of a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
A PQ tree is an advanced tree–based data structure, which represents a family of permutations on a set of elements. In this… (More)
  • figure I
  • figure II
  • figure III
  • figure IV
  • figure V
Is this relevant?
2008
2008
We give a linear-time planarity test that unifies and simplifies the algorithms of Shih and Hsu and Boyer and Myrvold; in our… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
  • Murat Uyara, Selcuk Yildirima, Muhsin Tunay Gencoglub
  • 2008
This paper presents a wav (PQ) disturbance classifica neural network (WNN). I wavelet feature extractor PQ signals used in this… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We analyse the queue Q L at a multiplexer with L inputs. We obtain a large deviation result, namely that under very general… (More)
  • figure 1
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A cryptanalytic attack on the use of short RSA secret exponents is described. This attack makes use of an algorithm based on… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
This paper presents a simple linear algorithm for embedding (or drawing) a planar graph in the plane. The algorithm is based on… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1976
Highly Cited
1976
A data structure called a PQ-tree is introduced. PQ-trees can be used to represent the permutations of a set U in which various… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?