portada An Optimal Algorithm to Find Minimum K-hop Dominating Set (en Inglés)

An Optimal Algorithm to Find Minimum K-hop Dominating Set (en Inglés)

Formato

Libro Físico

Autor

Sukumar Mondal

Madhumangal Pal

Editorial

LAP Lambert Academic Publishing

Idioma

Inglés

N° páginas

Encuadernación

Tapa Blanda

Dimensiones

22.9x15.2x0.4 cm

Peso

0.10 kg.

ISBN13

9786200248572

Categorías

Matemáticas

An Optimal Algorithm to Find Minimum K-hop Dominating Set (en Inglés)

Sukumar Mondal (Autor) · Madhumangal Pal (Autor) · LAP Lambert Academic Publishing · Tapa Blanda

Libro Nuevo Importado

Envío: 25 a 32 días háb.

$ 105.28$ 57.91

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 10 unidades

$ 57.91

Llega entre el 22 Sep y el 05 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "An Optimal Algorithm to Find Minimum K-hop Dominating Set (en Inglés)"

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