# K-tree

## Papers overview

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

2015

2015

- Discrete Applied Mathematics
- 2015

Let G be a graph with vetex set V (G) and edge set E(G). The first generalized multiplicative Zagreb index of G is ∏ 1,c(G) = ∏ v… (More)

Is this relevant?

2015

2015

- Electr. J. Comb.
- 2015

A tree is called a k-tree if its maximum degree is at most k. We prove the following theorem. Let k > 2 be an integer, and G be a… (More)

Is this relevant?

2010

2010

- Mathematics in Computer Science
- 2010

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

Is this relevant?

2009

2009

- HiPC
- 2009

Random Indexing (RI) K-tree is the combination of two algorithms for clustering. Many large scale problems exist in document… (More)

Is this relevant?

2009

2009

- Journal of Cryptology
- 2009

Consider the following problem: Given k=2 q random lists of n-bit vectors, L 1,…,L k , each of length m, find x 1∈L 1,…,x k ∈L k… (More)

Is this relevant?

2009

2009

- SIGIR
- 2009

We introduce K-tree in an information retrieval context. It is an efficient approximation of the k-means clustering algorithm… (More)

Is this relevant?

2008

2008

- INEX
- 2008

This paper describes the approach taken to the XML Mining track at INEX 2008 by a group at the Queensland University of… (More)

Is this relevant?

2003

2003

- WG
- 2003

A tree-partition of a graph is a partition of its vertices into ‘bags’ such that contracting each bag into a single vertex gives… (More)

Is this relevant?

1998

1998

- IEEE Trans. Parallel Distrib. Syst.
- 1998

A k-tree core of a tree network is a subtree with exactly k leaves that minimizes the total distance from vertices to the subtree… (More)

Is this relevant?

1993

1993

- Discrete Applied Mathematics
- 1993

Cai, L. and F. Maffray, On the SPANNING k-TREE problem, Discrete Applied Mathematics 44

Is this relevant?