Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

13 relations
Array data structureBinary treeGLibGraph theory
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Type 1 and 2 mixtures of Kullback-Leibler divergences as cost functions in dimensionality reduction based on similarity preservation
Stochastic neighbor embedding (SNE) and its variants are methods of dimensionality reduction (DR) that involve normalized softmax… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Cache "Less for More" in Information-Centric Networks
Ubiquitous in-network caching is one of the key aspects of information-centric networking (ICN) which has recently received… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2011
2011
Protected points in k-ary trees
  • T. Mansour
  • Appl. Math. Lett.
  • 2011
    • Corpus ID: 31178006
Following Cheon and Shapiro (2008) [3], in this note we compute the average number of protected points in all k-ary trees with n… Expand
Is this relevant?
2009
2009
Antibandwidth of complete k-ary trees
The antibandwidth problem is to label vertices of a n-vertex graph injectively by 1,2,3,...n, so that the minimum difference… Expand
  • figure 1
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
We consider the indexable dictionary problem, which consists of storing a set S ⊆ {0,…,m − 1} for some integer m while supporting… Expand
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Nonlinear dimensionality reduction of data manifolds with essential loops
Numerous methods or algorithms have been designed to solve the problem of nonlinear dimensionality reduction (NLDR). However… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
We consider the <i>indexable dictionary</i> problem which consists in storing a set <i>S</i> ⊆ {0,…, <i>m</i> - 1} for some… Expand
Is this relevant?
2000
2000
Generating Regular k-ary Trees Efficiently
A recursive algorithm GenWordsRand a non-recursive algorithmGenWordsNRare presented in this paper to generate sequences for… Expand
  • figure 1
  • figure 3
  • table 1
  • table 2
  • table 3
Is this relevant?
2000
2000
A Loopless Gray-Code Algorithm for Listing k-ary Trees
The bit sequence representation for k-ary trees is a sequence b1,b2,?,bnk+1 of bits that is formed by doing a preorder traversal… Expand
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Ranking and Listing Algorithms for k-ary Trees
The problem of ranking a finite set X may be defined as follows: if $|X| = N$, define a linear order on X and find the order… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE