We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the su...
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
We introduce a representation of subwords of the infinite Fibonacci word f∞ by a specific concatenation of finite Fibonacci words. It is unique and easily computable by backwa...