1421 search results - page 15 / 285 » Algorithms for subsequence combinatorics |
COMBINATORICS
2006
14 years 9 months ago
2006
In the game G0 two players alternate removing positive numbers of counters from a single pile and the winner is the player who removes the last counter. On the first move of the g...
COMBINATORICS
1998
14 years 9 months ago
1998
Based on a recent improvement of the inclusion-exclusion principle, we present a new approach to network reliability problems. In particular, we give a new proof of a result of Sh...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
47
Voted
ISAAC
2005
Springer
15 years 2 months ago
2005
Springer
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...