Zobrazeno 1 - 10
of 12
pro vyhledávání: '"R. M. R. Lewis"'
Autor:
R. M. R. Lewis
Publikováno v:
Texts in Computer Science ISBN: 9783030810535
A Guide to Graph Colouring ISBN: 9783319257280
A Guide to Graph Colouring ISBN: 9783319257280
In this chapter we now review many of the algorithmic techniques that can be (and have been) used for the graph colouring problem. The intention is to give the reader an overview of the different strategies available, including both exact and inexact
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c998c6412f3964bbe999714adbec7df
https://doi.org/10.1007/978-3-030-81054-2_4
https://doi.org/10.1007/978-3-030-81054-2_4
Autor:
R. M. R. Lewis
Publikováno v:
Texts in Computer Science ISBN: 9783030810535
A Guide to Graph Colouring ISBN: 9783319257280
A Guide to Graph Colouring ISBN: 9783319257280
In this chapter, our next case study considers the applicability of graph colouring methods for producing round-robin tournaments, which are particularly common in sporting competitions. As we will see, the task of producing valid round-robin tournam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b322b4709118680ec5050425987cfac
https://doi.org/10.1007/978-3-030-81054-2_8
https://doi.org/10.1007/978-3-030-81054-2_8
Autor:
R. M. R. Lewis
Publikováno v:
Texts in Computer Science ISBN: 9783030810535
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91b61544e4d3087b6bf29ee08f6f3b1c
https://doi.org/10.1007/978-3-030-81054-2
https://doi.org/10.1007/978-3-030-81054-2
Autor:
R. M. R. Lewis
Publikováno v:
Texts in Computer Science ISBN: 9783030810535
A Guide to Graph Colouring ISBN: 9783319257280
A Guide to Graph Colouring ISBN: 9783319257280
We are now at a point in this book where we have seen a number of different algorithms for the graph colouring problem and have noted many of their relative strengths and weaknesses. In this chapter we now present a range of problems, both theoretica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c4dfa9b73baae4d460d8a38a0c41d32
https://doi.org/10.1007/978-3-030-81054-2_6
https://doi.org/10.1007/978-3-030-81054-2_6
Autor:
R. M. R. Lewis
Publikováno v:
Texts in Computer Science ISBN: 9783030810535
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35c0d4d839161aa9e43033a8496d5cc3
https://doi.org/10.1007/978-3-030-81054-2_2
https://doi.org/10.1007/978-3-030-81054-2_2
Autor:
R. M. R. Lewis
Publikováno v:
Texts in Computer Science ISBN: 9783030810535
In the previous chapter, we arrived at the inconvenient conclusion that no polynomial-time algorithm exists for solving the graph colouring problem. The fact that graph colouring is “intractable” in this way implies that there is a limited amount
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43ff4e57b13000fd52f70a50b3eed407
https://doi.org/10.1007/978-3-030-81054-2_3
https://doi.org/10.1007/978-3-030-81054-2_3
Autor:
R. M. R. Lewis
Publikováno v:
Texts in Computer Science ISBN: 9783030810535
A Guide to Graph Colouring ISBN: 9783319257280
A Guide to Graph Colouring ISBN: 9783319257280
In mathematics, a graph can be thought of as a set of objects in which some pairs of objects are connected by links. The interconnected objects are usually called vertices, with the links connecting pairs of vertices termed edges. Graphs can be used
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5ebd0cf4ae9b0fa0bc3e46f4631218c
https://doi.org/10.1007/978-3-030-81054-2_1
https://doi.org/10.1007/978-3-030-81054-2_1
Autor:
R. M. R. Lewis
Publikováno v:
A Guide to Graph Colouring ISBN: 9783319257280
Towards the end of the previous chapter we saw a variety of different types of graphs that are relatively straightforward to colour optimally, including complete graphs, bipartite graphs, cycle and wheel graphs, and grid graphs. With regard to the ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::363a4a00d7a2d7481071aebef4c894a8
https://doi.org/10.1007/978-3-319-25730-3_2
https://doi.org/10.1007/978-3-319-25730-3_2
Autor:
R. M. R. Lewis
Publikováno v:
A Guide to Graph Colouring ISBN: 9783319257280
Texts in Computer Science ISBN: 9783030810535
Texts in Computer Science ISBN: 9783030810535
In this chapter, our final case study looks at how graph colouring concepts can be used in the construction of high-quality timetables for universities and other types of educational establishments. As we will see, this sort of problem can contain a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49ea99c21923f5b42e178d5f5d54a035
https://doi.org/10.1007/978-3-319-25730-3_8
https://doi.org/10.1007/978-3-319-25730-3_8
Autor:
R. M. R. Lewis
Publikováno v:
A Guide to Graph Colouring ISBN: 9783319257280
Texts in Computer Science ISBN: 9783030810535
Texts in Computer Science ISBN: 9783030810535
The three remaining chapters of this book each contain a detailed case study showing how graph colouring methods can be used to successfully tackle important realworld problems. The first of these case studies concerns the task of designing table pla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53f9a7aa5d1ce8a255463578074e9723
https://doi.org/10.1007/978-3-319-25730-3_6
https://doi.org/10.1007/978-3-319-25730-3_6