Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Jérémie Dusart"'
Publikováno v:
SIAM Journal on Computing. 50:1148-1153
This corrigendum corrects errors found by Jeremie Dusart in the proof of correctness of the algorithms in [D. G. Corneil, B. Dalton, and M. Habib, SIAM J. Comput., 42 (2013), pp. 792--807]; there a...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed91d62efa792c5ed18379f4590e00c2
https://doi.org/10.1137/20m1327835
https://doi.org/10.1137/20m1327835
Publikováno v:
Discrete Applied Mathematics. 238:1-13
Recently, Deshpande et al. introduced a new measure of the complexity of a Boolean function. We call this measure the “goal value” of the function. The goal value of f is defined in terms of a monotone, submodular utility function associated with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::856810150811e40a29a150d4eaed93d6
https://doi.org/10.1016/j.dam.2017.10.022
https://doi.org/10.1016/j.dam.2017.10.022
Publikováno v:
Algorithmica. 80:2834-2848
A linear ordering of the vertices of a graph G separates two edges of G if both the endpoints of one precede both the endpoints of the other in the order. We call two edges $$\{a,b\}$$ and $$\{c,d\}$$ of G strongly independent if the set of endpoints
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a2c5ca5caa0d2e6c32f0f6d639d6252
https://doi.org/10.1007/s00453-017-0353-x
https://doi.org/10.1007/s00453-017-0353-x
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783662535356
WG
WG
A linear ordering of the vertices of a graph Gseparates two edges of G if both the endpoints of one precede both the endpoints of the other in the order. We call two edges $$\{a,b\}$$ and $$\{c,d\}$$ of Gstrongly independent if the set of endpoints $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43c7a1595e0d75418dceb0ed22fb1e00
https://doi.org/10.1007/978-3-662-53536-3_11
https://doi.org/10.1007/978-3-662-53536-3_11
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