Fig 2 - uploaded by Jean-Michel Richer
Content may be subject to copyright.
– Evolution du score de la solution courante sur 3.10 5 itérations (instance zilla) partant d'un arbre initial construit selon une méthode de distances
Source publication
http://www710.univ-lyon1.fr/~csolnon
Similar publications
Directed acyclic graphs (DAGs) are directed graphs in which there is no path from a vertex to itself. DAGs are an omnipresent data structure in computer science and the problem of counting the DAGs of given number of vertices and to sample them uniformly at random has been solved respectively in the 70's and the 00's. In this paper, we propose to e...
Let S be a string built on some alphabet \(\varSigma \). A multi-cut rearrangement of S is a string \(S'\) obtained from S by an operation called k-cut rearrangement, that consists in (1) cutting S at a given number k of places in S, making S the concatenated string \(X_1\cdot X_2\cdot X_3\ldots X_k\cdot X_{k+1}\), where \(X_1\) and \(X_{k+1}\) are...