Sciweavers

62 search results - page 8 / 13
» ipl 2010
Sort
View
IPL
2010
247views more  IPL 2010»
13 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»
13 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
IPL
2010
115views more  IPL 2010»
13 years 8 months ago
Hardness and approximation of minimum distortion embeddings
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
Pinar Heggernes, Daniel Meister
IPL
2010
95views more  IPL 2010»
13 years 8 months ago
Resource bisimilarity and graded bisimilarity coincide
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...
Luca Aceto, Anna Ingólfsdóttir, Josh...
IPL
2010
84views more  IPL 2010»
13 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