Recomienda este artículo a tus amigos:
An Optimal Algorithm to Find Minimum K-hop Dominating Set Sukumar Mondal
Pedido desde almacén remoto
Los regalos de Navidad se podrán canjear hasta el 31 de enero
Nuestros clientes opinan:
An Optimal Algorithm to Find Minimum K-hop Dominating Set
Sukumar Mondal
Domination in graphs has been an extensively researched branch of graph theory. Among the variations of dominations, k-hop domination has been brie?y discussed in the past and it has important applications in communication networks. In this book, we consider the problem of ?nding a minimum k-hop dominating set of interval graphs. For this purpose, we ?rst construct the BFS-tree T with root as 1. After then we identify the main path of the BFS-tree T. Next we ?nd the ?rst member of k-hop dominating set of interval graph, by using some results. Then we ?nd the next member of k-hop dominating set by a procedure FindNext. Here, we proposed an O(n) time algorithm to ?nd a minimum k-hop dominating set of undirected and connected interval graphs with n vertices
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 22 de octubre de 2019 |
| ISBN13 | 9786200248572 |
| Editores | LAP Lambert Academic Publishing |
| Páginas | 64 |
| Dimensiones | 152 × 229 × 4 mm · 113 g |
| Lengua | Inglés |
