1421 search results - page 202 / 285 » Algorithms for subsequence combinatorics |
178
click to vote
CPM
2004
Springer
15 years 9 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
136
click to vote
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
133
click to vote
JCT
1998
15 years 3 months ago
1998
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
166
click to vote
DAM
2011
14 years 11 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
148
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...