K-tree

In graph theory, a k-tree is an undirected graph formed by starting with a (k + 1)-vertex complete graph and then repeatedly adding vertices in such…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

Sohrabi H. (2018): Adaptive k-tree sample plot for the estimation of stem density: An empirical approach. J. For. Sci., 64: 17–24…

2014

This thesis presents new methods for classification and thematic grouping of billions of web pages, at scales previously not…

2012

Abstract Hybrid automata are often cited as the best model to describe and analyze control-command systems. However, no formal…

2010

Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks…

2009

This paper examines the distances between vertices in a rooted k-tree, for a fixed k, by exhibiting a correspondence with a…

2009

Neste artigo, propomos uma nova representacao para k-arvores - o codigo compacto, que reduz o espaco de memoria de armazenamento…

2005

In this paper, we propose two efficient parallel algorithms for constructing a k-tree center and a k-tree core of a tree network…

2005

An undirected graph G=(V,E) is the k-power of an undirected tree T=(V,E′) if (u,v)∈ E iff u and v are connected by a path of…

1994

We report on the construction of many binary linear codes improving the tables of the best known codes. We obtained our results…

1993

The focus is on the following graph-theoretic question associated with the simulation of complete binary trees by faulty…