110 search results - page 8 / 22 » A degree bound on decomposable trees |
SIAMDM
2010
13 years 3 months ago
2010
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
GD
2006
Springer
14 years 3 days ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
JMLR
2010
13 years 3 months ago
2010
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
SIROCCO
2004
13 years 9 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
DAM
2006
13 years 8 months ago
2006
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...