K-ary tree

Known as: N-ary tree, K-ary trees, K-way tree 
In graph theory, a k-ary tree is a rooted tree in which each node has no more than k children. It is also sometimes known as a k-way tree, an N-ary… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Following [1], in this note we compute the average number of protected points in all k-ary trees with n internal points. 
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We consider the <i>indexable dictionary</i> problem, which consists of storing a set <i>S</i> ⊆ {0,…,<i>m</i> − 1} for some… (More)
  • figure 1
Is this relevant?
2006
2006
Starting from the root, extend k branches and append k children with probability p, or terminate with probability q = 1− p. Then… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We consider the <i>indexable dictionary</i> problem which consists in storing a set <i>S</i> ⊆ {0,…, <i>m</i> - 1} for some… (More)
Is this relevant?
2001
2001
Many algorithms have been developed to generate sequences for trees, and a few are to generate trees themselves, i.e., in… (More)
  • figure 2
  • figure 4
  • figure 3
  • figure 1
  • figure 5
Is this relevant?
2000
2000
A recursive algorithm GenWordsRand a non-recursive algorithmGenWordsNRare presented in this paper to generate sequences for… (More)
  • figure 1
  • figure 3
  • table 1
  • table 2
  • table 3
Is this relevant?
2000
2000
In this paper, we present a real-time faulttolerant design for an l-level k-ary tree multiprocessor with two modes of operations… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • table 1
Is this relevant?
1997
1997
In this paper, we present a strongly faulttolerant design for the l-level k-ary tree multiprocessor and examine its… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1994
1994
Roelants van Baronaigien (1991) gave an algorithm to generate all n-node binary tree representations with constant time between… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • table 1
Is this relevant?