Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/PQ_tree> ?p ?o }
Showing triples 1 to 46 of
46
with 100 triples per page.
- PQ_tree abstract "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 reorderings 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.".
- PQ_tree thumbnail Pq-tree-5-leaves.svg?width=300.
- PQ_tree wikiPageExternalLink pq-tree-algorithm-and-consecutive-ones.html.
- PQ_tree wikiPageExternalLink paper-1999-A_New_Planarity_test.pdf.
- PQ_tree wikiPageID "597568".
- PQ_tree wikiPageLength "4662".
- PQ_tree wikiPageOutDegree "18".
- PQ_tree wikiPageRevisionID "638379912".
- PQ_tree wikiPageWikiLink Category:Trees_(data_structures).
- PQ_tree wikiPageWikiLink Contig.
- PQ_tree wikiPageWikiLink Cyclic_order.
- PQ_tree wikiPageWikiLink DNA.
- PQ_tree wikiPageWikiLink Data_structure.
- PQ_tree wikiPageWikiLink George_S._Lueker.
- PQ_tree wikiPageWikiLink Interval_graph.
- PQ_tree wikiPageWikiLink Journal_of_Computer_and_System_Sciences.
- PQ_tree wikiPageWikiLink Kellogg_S._Booth.
- PQ_tree wikiPageWikiLink Leaf_node.
- PQ_tree wikiPageWikiLink Permutation.
- PQ_tree wikiPageWikiLink Planar_graph.
- PQ_tree wikiPageWikiLink Planarity_testing.
- PQ_tree wikiPageWikiLink Series-parallel_partial_order.
- PQ_tree wikiPageWikiLink Theoretical_Computer_Science_(journal).
- PQ_tree wikiPageWikiLink Tree_(data_structure).
- PQ_tree wikiPageWikiLink Wei-Kuan_Shih.
- PQ_tree wikiPageWikiLink Wen-Lian_Hsu.
- PQ_tree wikiPageWikiLink File:Pq-tree-5-leaves.svg.
- PQ_tree wikiPageWikiLinkText "PQ tree".
- PQ_tree wikiPageWikiLinkText "PQ_tree".
- PQ_tree hasPhotoCollection PQ_tree.
- PQ_tree wikiPageUsesTemplate Template:CS-Trees.
- PQ_tree wikiPageUsesTemplate Template:Cite_journal.
- PQ_tree subject Category:Trees_(data_structures).
- PQ_tree hypernym Structure.
- PQ_tree type Building.
- PQ_tree type Structure.
- PQ_tree type Technique.
- PQ_tree comment "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 reorderings of the children of its nodes.".
- PQ_tree label "PQ tree".
- PQ_tree sameAs m.02txfv.
- PQ_tree sameAs PQ-дерево.
- PQ_tree sameAs Q4046245.
- PQ_tree sameAs Q4046245.
- PQ_tree wasDerivedFrom PQ_tree?oldid=638379912.
- PQ_tree depiction Pq-tree-5-leaves.svg.
- PQ_tree isPrimaryTopicOf PQ_tree.