239 search results - page 11 / 48 » Hardness and algorithms for rainbow connection |
SODA
2012
ACM
12 years 12 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
CIAC
2010
Springer
14 years 6 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a maj...
DAGSTUHL
2007
14 years 11 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
GRAPHICSINTERFACE
2000
14 years 10 months ago
2000
In this paper we introduce a simple and efficient scheme for encodingthe connectivityand the stripification of a triangle mesh. Since generating a good set of triangle strips is a...