4137 search results - page 213 / 828 » On the number of matchings of a tree |
160
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
238
Voted
GD
2009
Springer
15 years 11 months ago
2009
Springer
We consider characterizations of level planar trees. Healy et al. [8] characterized the set of trees that are level planar in terms of two minimal level non-planar (MLNP) patterns....
186
click to vote
CGI
1998
IEEE
15 years 11 months ago
1998
IEEE
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
185
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
184
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...