Zobrazeno 1 - 10
of 70
pro vyhledávání: '"de Montgolfier, Fabien"'
Publikováno v:
In Theoretical Computer Science 26 June 2022 923:56-73
The Minimum Eccentricity Shortest Path (MESP) Problem consists in determining a shortest path (a path whose length is the distance between its extremities) of minimum eccentricity in a graph. It was introduced by Dragan and Leitert [9] who described
Externí odkaz:
http://arxiv.org/abs/1609.04593
In this paper, we consider the problem of the recognition of various kinds of orderings produced by graph searches. To this aim, we introduce a new framework, the Tie-Breaking Label Search (TBLS), in order to handle a broad variety of searches. This
Externí odkaz:
http://arxiv.org/abs/1501.06148
Publikováno v:
In Discrete Applied Mathematics 30 September 2020 284:353-374
This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n^2) decomposition algorithm and we take advantage of the i
Externí odkaz:
http://arxiv.org/abs/1310.1012
In this paper we explain how to easily compute gene clusters, formalized by classical or generalized nested common or conserved intervals, between a set of K genomes represented as K permutations. A b-nested common (resp. conserved) interval I of siz
Externí odkaz:
http://arxiv.org/abs/1305.4747
Publikováno v:
In Electronic Notes in Theoretical Computer Science 30 August 2019 346:159-169
Given a family F of subsets of a ground set V, its orthogonal is defined to be the family of subsets that do not overlap any element of F. Using this tool we revisit the problem of designing a simple linear time algorithm for undirected graph split (
Externí odkaz:
http://arxiv.org/abs/0902.1700
We analyze a distributed system where n nodes called boxes store a large set of videos and collaborate to serve simultaneously n videos or less. We explore under which conditions such a system can be scalable while serving any sequence of demands. We
Externí odkaz:
http://arxiv.org/abs/0804.0743
Autor:
Charbit, Pierre, Habib, Michel, Limouzy, Vincent, De Montgolfier, Fabien, Raffinot, Mathieu, Rao, Michaël
Let ${\cal V}$ be a finite set of $n$ elements and ${\cal F}=\{X_1,X_2, >..., X_m\}$ a family of $m$ subsets of ${\cal V}.$ Two sets $X_i$ and $X_j$ of ${\cal F}$ overlap if $X_i \cap X_j \neq \emptyset,$ $X_j \setminus X_i \neq \emptyset,$ and $X_i
Externí odkaz:
http://arxiv.org/abs/0711.4573