239 search results - page 32 / 48 » Hardness and algorithms for rainbow connection |
115
click to vote
GECCO
2010
Springer
15 years 3 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
GRAPHITE
2007
ACM
15 years 3 months ago
2007
ACM
Point-sampled geometry has gained significant interest due to their simplicity. The lack of connectivity touted as a plus, however, creates difficulties in many operations like ge...
AAAI
2008
15 years 2 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
120
click to vote
DCOSS
2008
Springer
15 years 1 months ago
2008
Springer
Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to ju...
CCCG
2004
15 years 1 months ago
2004
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...