Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Lalla Mouatadid"'
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
Autor:
Lalla Mouatadid
Publikováno v:
Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51e35cea5173b9c9116a3ad289816ff2
https://doi.org/10.1145/3488560.3510016
https://doi.org/10.1145/3488560.3510016
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
CALDAM
In order to understand underlying structural regularities in a graph, a basic and useful technique, known as modular decomposition, looks for subsets of vertices that have the exact same neighbourhood to the outside. These are known as modules and th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::483d6c46bc81d3948e2968c742478241
https://doi.org/10.1007/978-3-030-39219-2_5
https://doi.org/10.1007/978-3-030-39219-2_5
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
Autor:
Lalla Mouatadid, Ekkehard Köhler
Publikováno v:
Information Processing Letters. 116:391-395
The maximum weight independent set (WMIS) problem is a well-known NP-hard problem. It is a generalization of the maximum cardinality independent set problem where all the vertices have identical weights. There is an O ( n 2 ) time algorithm to comput
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c90275d912ce92fd592a0db34fb271ba
https://doi.org/10.1016/j.ipl.2015.12.001
https://doi.org/10.1016/j.ipl.2015.12.001
Publikováno v:
LNCS
COCOA 2017-11th Annual International Conference on Combinatorial Optimization and Applications
COCOA 2017-11th Annual International Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.154-168, ⟨10.1007/978-3-319-71147-8_11⟩
Combinatorial Optimization and Applications ISBN: 9783319711461
COCOA (2)
COCOA 2017-11th Annual International Conference on Combinatorial Optimization and Applications
COCOA 2017-11th Annual International Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.154-168, ⟨10.1007/978-3-319-71147-8_11⟩
Combinatorial Optimization and Applications ISBN: 9783319711461
COCOA (2)
Since its introduction to recognize chordal graphs by Rose, Tarjan, and Lueker, Lexicographic Breadth First Search (LexBFS) has been used to come up with simple, often linear time, algorithms on various classes of graphs. These algorithms are usually
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8e8f316abaafb781d6931b8b5eb43c4
https://hal.inria.fr/hal-01672521
https://hal.inria.fr/hal-01672521
Autor:
Lalla Mouatadid, Michel Habib
Publikováno v:
ISAAC 2017-28th International Symposium on Algorithms and Computation
ISAAC 2017-28th International Symposium on Algorithms and Computation, Dec 2017, Phuket, Thailand. pp.1-12, ⟨10.4230/LIPIcs.ISAAC.2017.43⟩
ISAAC 2017-28th International Symposium on Algorithms and Computation, Dec 2017, Phuket, Thailand. pp.1-12, ⟨10.4230/LIPIcs.ISAAC.2017.43⟩
We study the maximum induced matching problem on a graph G. Induced matchings correspond to independent sets in L^2(G), the square of the line graph of G. The problem is NP-complete on bipartite graphs. In this work, we show that for a number of grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b0936f7c0a897367540c1a4b84cb864d
Autor:
Lalla Mouatadid, Ekkehard Köhler
Publikováno v:
Algorithm Theory – SWAT 2014 ISBN: 9783319084039
SWAT
SWAT
Lexicographic depth first search (LexDFS) is a graph search protocol which has already proved to be a powerful tool on cocomparability graphs. Cocomparability graphs have been well studied by investigating their complements (comparability graphs) and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e011869d11f5b7293d96bb34b67d34c
https://doi.org/10.1007/978-3-319-08404-6_28
https://doi.org/10.1007/978-3-319-08404-6_28