1215 search results - page 157 / 243 » Combinatorics |
129
Voted
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
125
click to vote
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
127
click to vote
CPM
1999
Springer
15 years 7 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
132
Voted
CPM
1999
Springer
15 years 7 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
143
click to vote
CPM
1998
Springer
15 years 7 months ago
1998
Springer
While much work has been done on determining if a document or a line of a document contains an exact or approximate match to a regular expression, less e ort has been expended in ...