1421 search results - page 26 / 285 » Algorithms for subsequence combinatorics |
COMBINATORICS
2006
14 years 11 months ago
2006
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
125
click to vote
COMBINATORICS
2006
14 years 11 months ago
2006
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
104
click to vote
COCOON
1999
Springer
15 years 4 months ago
1999
Springer
El-Yaniv et al. presented an optimal on-line algorithm for the unidirectional currency conversion problem based on the threat-based strategy. Later, al-Binali pointed out that this...
COCOON
1999
Springer
15 years 4 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
103
click to vote
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...