156 search results - page 9 / 32 » Edge ranking of weighted trees |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
111
click to vote
PDCAT
2005
Springer
15 years 3 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
COMBINATORICS
2000
14 years 9 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
CGF
2008
14 years 9 months ago
2008
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
AUSAI
2006
Springer
15 years 1 months ago
2006
Springer
Decision tree-based probability estimation has received great attention because accurate probability estimation can possibly improve classification accuracy and probability-based r...