Sciweavers

1421 search results - page 14 / 285
» Algorithms for subsequence combinatorics
Sort
View
IPL
2007
99views more  IPL 2007»
15 years 4 months ago
Dynamic programming algorithms for the mosaic longest common subsequence problem
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yu...
99
Voted
KAIS
2007
117views more  KAIS 2007»
15 years 4 months ago
Finding the most unusual time series subsequence: algorithms and applications
Eamonn J. Keogh, Jessica Lin, Sang-Hee Lee, Helga ...
152
Voted
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
15 years 4 months ago
Minimum Connected Dominating Sets of Random Cubic Graphs
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
William Duckworth
COCOON
2007
Springer
15 years 11 months ago
An Improved Exact Algorithm for Cubic Graph TSP
It is shown that the traveling salesman problem for graphs
Kazuo Iwama, Takuya Nakashima