Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,608,949 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Apollonian network
Caterpillar tree
Clique (graph theory)
Clique problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Depth first search in claw-free graphs
Gábor Wiener
Optimization Letters
2018
Corpus ID: 20866445
Optimization problems concerning the vertex degrees of spanning trees of connected graphs play an extremely important role in…
Expand
2014
2014
Ab initio Prediction of RNA Nucleotide Interactions with Backbone k-Tree Model
Liang Ding
,
Xingran Xue
,
+4 authors
Liming Cai
CMSR@ECCB
2014
Corpus ID: 201494
Recently there have been many revelations of importance of RNAs to cellular functions and thus fast-growing interests in…
Expand
2013
2013
Plane 3-trees : Embeddability & Approximation ( Extended Abstract )
Stephane Durocher
,
Debajyoti Mondal
2013
Corpus ID: 6014506
We give anO(n log n)-time linear-space algorithm that, given a plane 3-tree G with n vertices and a set S of n points in the…
Expand
2012
2012
From control-command synchronous programs to hybrid automata
Olivier Bouissou
IFAC Conference on Analysis and Design of Hybrid…
2012
Corpus ID: 16145006
Abstract Hybrid automata are often cited as the best model to describe and analyze control-command systems. However, no formal…
Expand
2011
2011
Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
Dongxiao Yu
,
Yuexuan Wang
,
Qiang-Sheng Hua
,
F. Lau
International Computing and Combinatorics…
2011
Corpus ID: 17262938
We present new algorithms for exact multilinear k-monomial counting which is to compute the sum of coefficients of all degree-k…
Expand
2011
2011
The Extended k-tree Algorithm
L. Minder
,
A. Sinclair
Journal of Cryptology
2011
Corpus ID: 253637345
Consider the following problem: Given k=2q random lists of n-bit vectors, L1,…,Lk, each of length m, find x1∈L1,…,xk∈Lk such that…
Expand
2010
2010
Application of K-tree to document clustering
De Vries
,
C. Michael
2010
Corpus ID: 59794771
Digital collections are growing exponentially in size as the information age takes a firm grip on all aspects of society. As a…
Expand
2009
2009
Efficient Algorithms for Constructing a (k, l)- Center and a (k, l)- Core in a Tree Network
Yan Wang
,
Yongqiang Wang
International Conference on Innovative Computing…
2009
Corpus ID: 17280714
A (k, l)-center of a tree network is a subtree with exactly k leaves and with a diameter of at most l, which minimizes the…
Expand
2005
2005
Efficient Parallel Algorithms for Constructing a k-Tree Center and a k-Tree Core of a Tree Network
Yan Wang
,
Deqiang Wang
,
W. Liu
,
Baoyu Tian
International Symposium on Algorithms and…
2005
Corpus ID: 311852
In this paper, we propose two efficient parallel algorithms for constructing a k-tree center and a k-tree core of a tree network…
Expand
2000
2000
Heuristics for Minimum Spanning k-Trees
Alfredo Candia-V
2000
Corpus ID: 16164622
We present a class of greedy heuristics for the Minimum Spanning k-Tree Problem, a NPHard combinatorial optimization problem…
Expand