6740 search results - page 262 / 1348 » An s -Hamiltonian Line Graph Problem |
96
Voted
EUROPAR
1999
Springer
15 years 5 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
121
click to vote
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
117
Voted
VIS
2007
IEEE
16 years 2 months ago
2007
IEEE
In nature and in flow experiments particles form patterns of swirling motion in certain locations. Existing approaches identify these structures by considering the behavior of stre...
136
click to vote
SEAA
2008
IEEE
15 years 7 months ago
2008
IEEE
Grid access methods are still dominated by command line tools or manually developed, problem specific graphical user interfaces. This fact reduces the acceptance of the Grid for ...