2354 search results - page 83 / 471 » Radio number for trees |
190
click to vote
INFORMATICALT
2010
15 years 1 months ago
2010
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
158
click to vote
WG
2009
Springer
16 years 23 days ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
177
click to vote
WAOA
2007
Springer
16 years 9 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
115
click to vote
DAM
2006
15 years 6 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...
173
click to vote
PKDD
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents an unsupervised discretization method that performs density estimation for univariate data. The subintervals that the discretization produces can be used as the...