Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Stack-sortable_permutation> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Stack-sortable_permutation abstract "In mathematics and computer science, a stack-sortable permutation (also called a tree permutation) is a permutation whose elements may be sorted by an algorithm whose internal storage is limited to a single stack data structure. The stack-sortable permutations are exactly the permutations that do not contain the permutation pattern 231; they are counted by the Catalan numbers, and may be placed in bijection with many other combinatorial objects with the same counting function including Dyck paths and binary trees.".
- Stack-sortable_permutation wikiPageExternalLink v9i2a1.html.
- Stack-sortable_permutation wikiPageID "39287529".
- Stack-sortable_permutation wikiPageRevisionID "579840210".
- Stack-sortable_permutation subject Category:Permutation_patterns.
- Stack-sortable_permutation comment "In mathematics and computer science, a stack-sortable permutation (also called a tree permutation) is a permutation whose elements may be sorted by an algorithm whose internal storage is limited to a single stack data structure.".
- Stack-sortable_permutation label "Stack-sortable permutation".
- Stack-sortable_permutation sameAs m.0t_fjg7.
- Stack-sortable_permutation sameAs Q17103625.
- Stack-sortable_permutation sameAs Q17103625.
- Stack-sortable_permutation wasDerivedFrom Stack-sortable_permutation?oldid=579840210.
- Stack-sortable_permutation isPrimaryTopicOf Stack-sortable_permutation.