FCT
2005
Springer
14 years 7 months ago
2005
Springer
FCT
2005
Springer
14 years 7 months ago
2005
Springer
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
FCT
2005
Springer
14 years 7 months ago
2005
Springer
: In this paper, we investigate the problem to find an acyclic subhypergraph in a given hypergraph, which is an extension to find a tree in a graph. First, we introduce a spannin...
FCT
2005
Springer
14 years 7 months ago
2005
Springer
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
FCT
2005
Springer
14 years 7 months ago
2005
Springer
FCT
2005
Springer
14 years 7 months ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
FCT
2005
Springer
14 years 7 months ago
2005
Springer
FCT
2005
Springer
14 years 7 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
FCT
2005
Springer
14 years 7 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
FCT
2005
Springer
14 years 7 months ago
2005
Springer
