17920 search results - page 443 / 3584 » Recentering computer science |
170
click to vote
TCS
2010
15 years 5 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
196
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
197
Voted
GI
2010
Springer
15 years 4 months ago
2010
Springer
: In several industry scenarios, it is often the case that an existing reference workflow has to be adapted according to specific context factors, which might even change at runtim...
216
Voted
ERSHOV
2009
Springer
15 years 4 months ago
2009
Springer
Model checking of software has been a very active research topic recently. As a result, a number of software model checkers have been developed for analysis of software written in ...
180
Voted
GI
2009
Springer
15 years 4 months ago
2009
Springer
: Nowadays, the necessity of safeguarded environments is stronger than ever. The defence of public areas against terroristic threats requires intelligent security assistance system...