Jean Daligault

Learn More
1 ENS Ca han, 61, avenue du Président Wilson, 94235 Ca han edex Fran e E-mail address: nbousque dptinfo.ensa han.fr 2 Université Montpellier II CNRS, LIRMM, 161 rue Ada 34392 Montpellier Cedex 5 Fran e E-mail address: daligault lirmm.fr E-mail address: thomasse lirmm.fr 3 Royal Holloway, University of London, Egham Hill, EGHAM, TW20 0EX UK E-mail address:(More)
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion(More)
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero are leaves. In the Directed Max Leaf Problem, we wish to find the maximum number of leaves in an out-branching of a given digraph D (or, to report that D has no out-branching). In(More)
Quickselect with median-of-three is routinely used as the method of choice for selection of the mth element out of n in general-purpose libraries such as the C++ Standard Template Library. Its average behavior is fairly well understood and has been shown to outperform that of the standard variant, which chooses a random pivot on each stage. However, no(More)
The parameterized Multicut problem consists in deciding, given a graph, a set of requests (i.e. pairs of vertices) and an integer k, whether there exists a set of k edges which disconnects the two endpoints of each request. Determining whether Multicut is Fixed-Parameter Tractable with respect to k is one of the most important open question in parameterized(More)
  • 1