Michel Koskas

collaborators

2 papers

math.CO2008

Words and morphisms with Sturmian erasures

Fabien Durand, Adel Guerziz, Michel Koskas

We say $x \in \{0,1,2 \}^{\NN}$ is a word with Sturmian erasures if for any $a \in {0, 1, 2}$ the word obtained erasing all $a$ in $x$ is a Sturmian word. A large family of such wo…

cs.DS2003

A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs

Michel Koskas

This paper details a new algorithm to solve the shortest path problem in valued graphs. Its complexity is $O (D lo g v)$ where $D$ is the graph diameter and $v$ its number of vertic…