156 search results - page 14 / 32 » Edge ranking of weighted trees |
109
click to vote
IEICET
2011
14 years 4 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
DAM
2000
14 years 9 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
79
Voted
COMBINATORICS
2006
14 years 9 months ago
2006
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...
105
click to vote
ICPADS
2007
IEEE
15 years 4 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
104
click to vote
AINA
2005
IEEE
15 years 3 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...