982 search results - page 86 / 197 » Solving Steiner tree problems in graphs to optimality |
141
click to vote
PODC
2011
ACM
14 years 27 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
SIAMCOMP
2000
14 years 9 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
SIGARCH
2008
14 years 10 months ago
2008
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
108
click to vote
CEC
2011
IEEE
13 years 10 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
ISAAC
2007
Springer
15 years 4 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...