156 search results - page 7 / 32 » Edge ranking of weighted trees |
176
click to vote
NETWORKS
2008
15 years 6 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
168
click to vote
WDAG
2007
Springer
16 years 4 days ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
153
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
158
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
170
click to vote
CATS
2006
15 years 7 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...