721 search results - page 119 / 145 » Bounds on the k-domination number of a graph |
168
click to vote
CIAC
2006
Springer
15 years 9 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
137
click to vote
AAAI
2006
15 years 7 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
148
click to vote
IJMC
2006
15 years 6 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
168
click to vote
APPROX
2009
Springer
16 years 21 days ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
163
click to vote
GBRPR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...