Scribd
Upload
48 views4 pages

Answers From Abhijit

PQ trees and PC trees are data structures that represent permutations or orderings of elements. PQ trees represent orderings that satisfy the consecutive 1's property, where elements in each row are consecutive, while PC trees represent orderings that satisfy the circular 1's property, where elements in each row are either consecutive or the reverse. PC trees generalize PQ trees by being unrooted and allowing cyclic reorderings, making them able to represent more orderings. Both data structures are used in applications like testing matrices for these properties and planarity testing of graphs.

Uploaded by

abhijitdasnits
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
48 views4 pages

Answers From Abhijit

PQ trees and PC trees are data structures that represent permutations or orderings of elements. PQ trees represent orderings that satisfy the consecutive 1's property, where elements in each row are consecutive, while PC trees represent orderings that satisfy the circular 1's property, where elements in each row are either consecutive or the reverse. PC trees generalize PQ trees by being unrooted and allowing cyclic reorderings, making them able to represent more orderings. Both data structures are used in applications like testing matrices for these properties and planarity testing of graphs.

Uploaded by

abhijitdasnits
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Planarity, PQ Trees, Consecutive 1s Property and PC Trees

1. How can you check that a given graph is planar?


Ans. A finite graph is planar if and only if it does not contain a subgraph that is a
subdivision of K
5
(the complete graph on five vertices) or K
3,3
(complete bipartite graph
on six vertices, three of which connect to each of the other three, also known as the
utility graph).
In practice, it is difficult to use Kuratowski's criterion to quickly decide whether a given
graph is planar. However, there exist fast algorithms for this problem: for a graph with
n vertices, it is possible to determine in time O(n) (linear time) whether the graph may
be planar or not (see planarity testing).
For a simple, connected, planar graph with v vertices and e edges, the following simple
planarity criteria hold:
Theorem 1. If v 3 then e 3v 6;
Theorem 2. If v 3 and there are no cycles of length 3, then e 2v 4.

2. What are PQ trees?
Ans. 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 George S. Lueker
in 1976. It is a rooted, labeled tree, in which each element is represented by one of the
leaf nodes, and each non-leaf node is labelled P or Q. A P node has at least two
children, and a Q node has at least three children.
A PQ tree represents its permutations via permissible reordering of the children of its
nodes. The children of a P node may be reordered in any way. The children of a Q node
may be put in reverse order, but may not otherwise be reordered. A PQ tree represents
all leaf node orderings that can be achieved by any sequence of these two operations.
A PQ tree with many P and Q nodes can represent complicated subsets of the set of all
possible orderings. However, not every set of orderings may be representable in this
way; for instance, if an ordering is represented by a PQ tree, the reverse of the
ordering must also be represented by the same tree.
PQ trees are used to solve problems where the goal is to find an ordering that satisfies
various constraints. In these problems, constraints on the ordering are included one at
a time, by modifying the PQ tree structure in such a way that it represents only
orderings satisfying the constraint. Applications of PQ trees include creating a contig
map from DNA fragments, testing a matrix for the consecutive ones property,
recognizing interval graphs and determining whether a graph is planar.



3. What are the differences between PQ Trees & PC Trees?
Ans. The PC tree, developed by Wei-Kuan Shih and Wen-Lian Hsu, is a more recent
generalization of the PQ tree. Like the PQ tree, it represents permutations by
reorderings of nodes in a tree, with elements represented at the leaves of the tree.
Unlike the PQ tree, the PC tree is unrooted. The nodes adjacent to any non-leaf node
labeled P may be reordered arbitrarily as in the PQ tree, while the nodes adjacent to
any non-leaf node labeled C have a fixed cyclic order and may only be reordered by
reversing this order. Thus, a PC tree can only represent sets of orderings in which any
circular permutation or reversal of an ordering in the set is also in the set. However, a
PQ tree on n elements may be simulated by a PC tree on n + 1 elements, where the
extra element serves to root the PC tree. The data structure operations required to
perform a planarity testing algorithm on PC trees are somewhat simpler than the
corresponding operations on PQ trees.
A data structure called PC-tree is considered here as a generalization of PQ-trees. PC-
trees were originally introduced to represent partial embeddings of planar graphs in
Shih and Hsu. PQ-trees were used to test the consecutive ones property in matrices.
However, the implementation of PQ-tree algorithms by Booth and Lueker (hereafter,
referred to as the B&L algorithm) is rather complicated. Also the complexity analysis is
rather intricate.

4. Differentiate between Consecutive 1s ordering & Circular 1s Ordering.
Ans. A 0-1 matrix has the consecutive-ones property if its columns can be ordered so
that the ones in every row are consecutive. It has the circular-ones property if its
columns can be ordered so that, in every row, either the ones or the zeros are
consecutive. PQ trees are used for representing all consecutive-ones orderings of the
columns of a matrix that have the consecutive-ones property. We give an analogous
structure, called a PC tree, for representing all circular-ones orderings of the columns of
a matrix that has the circular-ones property.





5. Write the PQ Tree Algorithm for Consecutive 1s ordering
Ans.



6. Discuss some of the applications of PQ Trees.
Ans.
a. Efficient sub-typing tests with PQ-encoding
b. PQ-trees and the Set of All Distinct Planar Embeddings of a Graph
c. Erratum: The Travelling Salesman and the PQ-Tree
d. Discovering functional gene expression patterns in the metabolic network of
Escherichia coli with wavelets transforms
e. Gene Proximity Analysis Across Whole Genomes via PQ Trees

ALL THE BEST

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy