Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Fabien de Montgolfier"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 5, Iss 1 (2002)
A factorizing permutation of a given graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here
Externí odkaz:
https://doaj.org/article/2e9efd46ec764df798146183d1950a56
Publikováno v:
Theoretical Computer Science. 923:56-73
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5926bc524df8aeaffb08a452dcad6361
https://doi.org/10.1016/j.tcs.2022.04.052
https://doi.org/10.1016/j.tcs.2022.04.052
Publikováno v:
Electronic Notes in Theoretical Computer Science
Electronic Notes in Theoretical Computer Science, Elsevier, 2019, 346, pp.159-169. ⟨10.1016/j.entcs.2019.08.015⟩
Electronic Notes in Theoretical Computer Science, 2019, 346, pp.159-169. ⟨10.1016/j.entcs.2019.08.015⟩
LAGOS
Electronic Notes in Theoretical Computer Science, Elsevier, 2019, 346, pp.159-169. ⟨10.1016/j.entcs.2019.08.015⟩
Electronic Notes in Theoretical Computer Science, 2019, 346, pp.159-169. ⟨10.1016/j.entcs.2019.08.015⟩
LAGOS
International audience; In this paper we investigate the Minimum Eccentricity Isometric Cycle (MEIC) problem. Given a graph, this problem consists in finding an isometric cycle with smallest possible eccentricity k. We show that this problem is NP-Ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d892b0cb06a0c02f47ee80954717c82b
https://hal.inria.fr/hal-02430756/document
https://hal.inria.fr/hal-02430756/document
Publikováno v:
IWOCA 2019-30th International Workshop on Combinatorial Algorithms
IWOCA 2019-30th International Workshop on Combinatorial Algorithms, Jul 2019, Pise, Italy. ⟨10.1007/978-3-030-25005-8_21⟩
IWOCA 2019-30th International Workshop on Combinatorial Algorithms, Jul 2019, Pise, Italy
Lecture Notes in Computer Science ISBN: 9783030250041
IWOCA
IWOCA 2019-30th International Workshop on Combinatorial Algorithms, Jul 2019, Pise, Italy. ⟨10.1007/978-3-030-25005-8_21⟩
IWOCA 2019-30th International Workshop on Combinatorial Algorithms, Jul 2019, Pise, Italy
Lecture Notes in Computer Science ISBN: 9783030250041
IWOCA
We study here algorithmic aspects of modular decomposition of hypergraphs. In the literature one can find three different definitions of modules, namely: the standard one [19], the k-subset modules [6] and the Courcelle’s one [11]. Using the fundam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9fe62653f8ec5f40fef4518bf0fd7781
https://hal.inria.fr/hal-02423508
https://hal.inria.fr/hal-02423508
Publikováno v:
28th International Symposium on Algorithms and Computation (ISAAC 2017)
28th International Symposium on Algorithms and Computation (ISAAC 2017), Dec 2017, Phuket, Thailand. ⟨10.4230/LIPIcs.ISAAC.2017.15⟩
MAP5 2017-18. 2017
28th International Symposium on Algorithms and Computation (ISAAC 2017), Dec 2017, Phuket, Thailand. ⟨10.4230/LIPIcs.ISAAC.2017.15⟩
MAP5 2017-18. 2017
International audience; We introduce the problem of hub-laminar decomposition which generalizes that of computing a shortest path with minimum eccentricity (MESP). Intuitively, it consists in decomposing a graph into several paths that collectively h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc23302dbd295b2c90be084fe997562f
https://hal.science/hal-01511357v2/document
https://hal.science/hal-01511357v2/document
Publikováno v:
COCOA 2016, Combinatorial Optimization and Applications-10th International Conference
COCOA 2016, Combinatorial Optimization and Applications-10th International Conference, Dec 2016, Hong Kong, China. pp.216-229, ⟨10.1007/978-3-319-48749-6_16⟩
MAP5 2016-26. 2016
COCOA 2016, Combinatorial Optimization and Applications-10th International Conference, Dec 2016, Hong Kong, China. pp.216-229, 2016, 〈https://conference.cs.cityu.edu.hk/cocoa2016/〉. 〈10.1007/978-3-319-48749-6_16〉
Combinatorial Optimization and Applications ISBN: 9783319487489
COCOA
COCOA 2016, Combinatorial Optimization and Applications-10th International Conference, Dec 2016, Hong Kong, China. pp.216-229, ⟨10.1007/978-3-319-48749-6_16⟩
MAP5 2016-26. 2016
COCOA 2016, Combinatorial Optimization and Applications-10th International Conference, Dec 2016, Hong Kong, China. pp.216-229, 2016, 〈https://conference.cs.cityu.edu.hk/cocoa2016/〉. 〈10.1007/978-3-319-48749-6_16〉
Combinatorial Optimization and Applications ISBN: 9783319487489
COCOA
International audience; 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 Le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df887d4f94e0d7ab2c374a34df06d7bb
https://hal.archives-ouvertes.fr/hal-01366782/document
https://hal.archives-ouvertes.fr/hal-01366782/document
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, 2016, 199, pp.89-100. ⟨10.1016/j.dam.2015.06.011⟩
Discrete Applied Mathematics, Elsevier, 2016, 199, pp.89-100. ⟨10.1016/j.dam.2015.06.011⟩
Discrete Applied Mathematics, 2016, 199, pp.89-100. ⟨10.1016/j.dam.2015.06.011⟩
Discrete Applied Mathematics, Elsevier, 2016, 199, pp.89-100. ⟨10.1016/j.dam.2015.06.011⟩
International audience; In this paper, we consider the problem of the recognition of various kinds of orderings produced bygraph searches. To this aim, we introduce a new framework, the Tie-Breaking Label Search (TBLS),in order to handle a broad vari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4197633c980c39cf06d945b97f69bab
https://inria.hal.science/hal-01255055
https://inria.hal.science/hal-01255055
Autor:
Mathieu Raffinot, Pierre Charbit, Vincent Limouzy, Michel Habib, Fabien de Montgolfier, Michaël Rao
Publikováno v:
Information Processing Letters
Information Processing Letters, Elsevier, 2008, 108 (4), pp.186-191. ⟨10.1016/j.ipl.2008.05.005⟩
Information Processing Letters, Elsevier, 2008, 108 (4), pp.186-191. ⟨10.1016/j.ipl.2008.05.005⟩
International audience; Let ${\cal V}$ be a finite set of $n$ elements and ${\cal F}=\{X_1,X_2, \ldots , 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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03554a04b7ff7d9f48e4142e3836cce3
https://doi.org/10.1016/j.ipl.2008.05.005
https://doi.org/10.1016/j.ipl.2008.05.005
Publikováno v:
SIAM Journal on Discrete Mathematics. 22:1022-1039
We introduce a new approach to compute the common intervals of $K$ permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple and efficient algorithms to compute the set of all common inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e53501703d1e9780d0f4748bb22821bc
https://doi.org/10.1137/060651331
https://doi.org/10.1137/060651331
Autor:
Fabien de Montgolfier, Michaël Rao
Publikováno v:
Electronic Notes in Discrete Mathematics. 22:173-177
We introduce a new generalization of the modular decomposition called the bi-join decomposition . We characterize the completely decomposable graphs and we give a linear-time decomposition algorithm.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edd39dd08b438584ac4440a1770fee84
https://doi.org/10.1016/j.endm.2005.06.039
https://doi.org/10.1016/j.endm.2005.06.039