Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Array data structureBinary treeGLibGraph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Fast language-independent correction of interconnected typos to finding longest terms
Triagers deal with bug reports in software triage systems like Bugzilla to prioritizing, finding duplicates, and assigning those… 
Review
2018
Review
2018
Comparing Apples and Oranges: The Weighted OWA Function
This paper advocates the use of weighted ordered weighted averaging (WOWA) functions in decision‐making processes, where the… 
2009
2009
Recursive Generation of k-ary Trees
In this paper we present a construction of every k-ary tree using a forest of (k − 1)ary trees satisfying a particular condition… 
2006
2006
Models of adding relations to an organization structure of a complete K
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… 
1999
1999
Systolic Generation of k-Ary Trees
The only parallel generating algorithms for k-ary trees are those of Akl and Stojmenovic in 1996 and of Vajnovszki and Phillips… 
1999
1999
On the Performance Merits of Bypass Channels in Hypermeshes and k-Ary n-Cubes
Low-dimensional k-ary n-cubes have been popular in recent multicomputers. These networks, however, suffer from high switching… 
Highly Cited
1998
Highly Cited
1998
Allocation and scheduling algorithms for IEEE 802.14 and MCNS in hybrid fiber coaxial networks
IEEE 802.14 and MCNS (multimedia cable network system) are two standards developed for the hybrid fiber coaxial (HFC) CATV… 
1997
1997
Conflict-free template access in k-ary and binomial trees
Load balanced data distribution among various memory modules in a multiprocessor architecture or among multiple disks in a… 
1992
1992
Efficient Generation of k-ary Trees in Natural Order (Short Note)
A k-ary tree with n nodes can be encoded as a k-inorder-preorder sequence of length (k-1)n by labelling the tree from 1 to (k-1)n… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)