Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Simon Crevals"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 14 no. 1, Iss Graph Theory (2012)
Graph Theory
Externí odkaz:
https://doaj.org/article/84da885c58754a4d92ba990a06d1a544
Autor:
Patric R. J. Östergård, Simon Crevals
Publikováno v:
Discrete Mathematics. 338(8):1379-1384
Let i m , n denote the minimum size of an independent dominating set in the m -by- n grid. In this article a dynamic programming algorithm is described that computes i m , n for fixed m and arbitrary n . For m < 16 , the algorithm is used to determin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c79a1427665876473dba02e9864596c
https://doi.org/10.1016/j.disc.2015.02.015
https://doi.org/10.1016/j.disc.2015.02.015
Publikováno v:
Discrete Applied Mathematics. 161:573-579
In this article, we describe an algorithm to find the optimal communication network for the new GPS III satellite system. Finding a possible network will be translated to a maximum clique problem and an efficient algorithm for finding all maximum cli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df20e9a7a3e232cdaf5c5b83faea7e75
https://doi.org/10.1016/j.dam.2011.07.006
https://doi.org/10.1016/j.dam.2011.07.006
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2012, Vol. 14 no. 1 (1), pp.159-174
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2012, Vol. 14 no. 1 (1), pp.159-174
Graph Theory
We present theoretical and computational results on alpha-labelings of trees. The theorems proved in this paper were inspired by the results of a computer investigation of alpha-labelings of all trees with up to 26 vertices, all tre
We present theoretical and computational results on alpha-labelings of trees. The theorems proved in this paper were inspired by the results of a computer investigation of alpha-labelings of all trees with up to 26 vertices, all tre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd10bef3b88c084a7b945dd52898500f
https://hal.inria.fr/hal-00990566
https://hal.inria.fr/hal-00990566
Publikováno v:
The Electronic Journal of Combinatorics. 18
Let $\gamma_{m,n}$ denote the size of a minimum dominating set in the $m \times n$ grid graph. For the square grid graph, exact values for $\gamma_{n,n}$ have earlier been published for $n \leq 19$. By using a dynamic programming algorithm, the value
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17541aeb827efdc15f163074a5720193
https://doi.org/10.37236/628
https://doi.org/10.37236/628