Zobrazeno 1 - 10
of 416
pro vyhledávání: '"D. de Werra"'
Publikováno v:
Theoretical Computer Science. 877:36-45
The exploration of one-factorizations of complete graphs is the foundation of some classical sports scheduling problems. One has to traverse the landscape of such one-factorizations by moving from one of those to a so-called neighbor one-factorizatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b08cb31a02bed5d1ac4e39f74459863
https://doi.org/10.1016/j.tcs.2021.03.029
https://doi.org/10.1016/j.tcs.2021.03.029
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030489656
IWOCA
Combinatorial Algorithms
IWOCA
Combinatorial Algorithms
Cographs constitute a small point in the atlas of graph classes. However, by zooming in on this point, we discover a complex world, where many parameters jump from finiteness to infinity. In the present paper, we identify several milestones in the wo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8796d8bcfd48b3371ac6fe2388e6e366
Autor:
D. de Werra
Publikováno v:
The Many Facets of International Education of Engineers ISBN: 9781003078647
The Many Facets of International Education of Engineers
The Many Facets of International Education of Engineers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::485e291e80fe1ae84ea66fac9cfa03d6
https://doi.org/10.1201/9781003078647-35
https://doi.org/10.1201/9781003078647-35
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2020, ⟨10.1016/j.dam.2019.11.022⟩
Discrete Applied Mathematics, Elsevier, 2020, ⟨10.1016/j.dam.2019.11.022⟩
Let G = ( V , E ) be a simple loopless finite undirected graph. We say that G is (2-factor) expandable if for any non-edge u v , G + u v has a 2-factor F that contains u v . We are interested in the following: Given a positive integer n = | V | , wha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93f75da5469cebe892d92166d0c5627f
https://hal.archives-ouvertes.fr/hal-02436792
https://hal.archives-ouvertes.fr/hal-02436792
Autor:
Cédric Bentz, Rico Zenklusen, Marie-Christine Costa, D. de Werra, Bernard Ries, Christophe Picouleau
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2010, 310, pp.132--146. ⟨10.1016/j.disc.2009.08.009⟩
Discrete Mathematics, Elsevier, 2010, 310, pp.132--146. ⟨10.1016/j.disc.2009.08.009⟩
Given an undirected graph G = (V, E) with matching number nu(G), a d-blocker is a subset of edges B such that nu((V, E \ B)) = d. While the associated decision problem is NP-complete in bipartite graphs we show how to construct efficiently minimum d-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89f257dc738495d993b15977b349e296
http://doc.rero.ch/record/326878/files/blockersandtransversalsii.pdf
http://doc.rero.ch/record/326878/files/blockersandtransversalsii.pdf
Publikováno v:
Discrete Optimization
Discrete Optimization, Elsevier, 2009, 6 (4), pp.362--369. ⟨10.1016/j.disopt.2009.04.005⟩
Discrete Optimization, Elsevier, 2009, 6 (4), pp.362--369. ⟨10.1016/j.disopt.2009.04.005⟩
Extensions and variations of the basic problem of graph coloring are introduced. The problem consists essentially in finding in a graph G a k-coloring, i.e., a partition V-1,...,V-k of the vertex set of G such that, for some specified neighborhood (N
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2fdf9872a98958bad91f1e1163760f9d
http://doc.rero.ch/record/324621/files/neighborhood.pdf
http://doc.rero.ch/record/324621/files/neighborhood.pdf
Autor:
Rico Zenklusen, Marie-Christine Costa, Bernard Ries, Christophe Picouleau, Cédric Bentz, D. de Werra
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2009, 13, pp.4306--4314. ⟨10.1016/j.disc.2009.01.006⟩
Discrete Mathematics, Elsevier, 2009, 13, pp.4306--4314. ⟨10.1016/j.disc.2009.01.006⟩
Given an undirected graph G = (V, E) with matching number v(G), we define d-blockers as subsets of edges B such that nu((V, E \ B)) = d. We explore connections between d-blockers and d-transversals. Special classes of graphs are examined which includ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e90a19ef38d615e7d7d472538756a94d
http://doc.rero.ch/record/324622/files/blockersandtransversalsi.pdf
http://doc.rero.ch/record/324622/files/blockersandtransversalsi.pdf
Publikováno v:
European Journal of Operational Research. 254:1-8
In this work, we consider some basic sports scheduling problems and introduce the notions of graph theory which are needed to build adequate models. We show, in particular, how edge coloring can be used to construct schedules for sports leagues. Due
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7adb6f6a886cdd7b5491ae58545da585
https://doi.org/10.1016/j.ejor.2016.03.038
https://doi.org/10.1016/j.ejor.2016.03.038
Publikováno v:
Discrete Applied Mathematics. 211:113-120
The canonical method is widely used to build single round robin schedules for sports competitions. Certain properties of the canonical method may entrap local search procedures. In this paper, we study the connectivity of one of the most used neighbo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e47235262787bcf5b39b160399a636d7
https://doi.org/10.1016/j.dam.2016.04.018
https://doi.org/10.1016/j.dam.2016.04.018
Publikováno v:
Annals of Operations Research
Annals of Operations Research, Springer Verlag, 2010, 175, pp.287-307. ⟨10.1007/s10479-009-0649-6⟩
Annals of Operations Research, Springer Verlag, 2010, 175, pp.287-307. ⟨10.1007/s10479-009-0649-6⟩
International audience; In this tutorial paper, we consider the basic image reconstruction problem which stems from discrete tomography. We derive a graph theoretical model and we explore some variations and extensions of this model. This allows us t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9163997b3fe684c795a74e108bac041
http://doc.rero.ch/record/321730/files/10288_2008_Article_77.pdf
http://doc.rero.ch/record/321730/files/10288_2008_Article_77.pdf