Sciweavers

200 search results - page 22 / 40
» ipl 2006
Sort
View
IPL
2010
84views more  IPL 2010»
14 years 8 months ago
Wee LCP
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...
Johannes Fischer
IPL
2010
107views more  IPL 2010»
14 years 8 months ago
Disjoint pattern matching and implication in strings
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...
Leonid Libkin, Cristina Sirangelo
IPL
2010
160views more  IPL 2010»
14 years 8 months ago
Antimagic labeling and canonical decomposition of graphs
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...
Michael D. Barrus
IPL
2010
247views more  IPL 2010»
14 years 8 months ago
The Floyd-Warshall algorithm on graphs with negative cycles
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 ...
Stefan Hougardy
IPL
2010
69views more  IPL 2010»
14 years 8 months ago
A simple representation of subwords of the Fibonacci word
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...
Bartosz Walczak