你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

Select your country

Americas

Europe

Rest of the world

portada An Optimal Algorithm to Find Minimum K-hop Dominating Set
Type
Physical Book
Language
English
Pages
64
Format
Paperback
Dimensions
22.9x15.2x0.4 cm
Weight
0.10 kg.
ISBN13
9786200248572
Categories

An Optimal Algorithm to Find Minimum K-hop Dominating Set

Sukumar Mondal (Author) · Madhumangal Pal (Author) · LAP Lambert Academic Publishing · Paperback

An Optimal Algorithm to Find Minimum K-hop Dominating Set - Mondal, Sukumar ; Pal, Madhumangal

New Book Imported to Taiwan
Delivery: 16 Oct - 26 Oct Shipping: 14 to 15 business days.
NT$ 1,543
NT$ 1,543

Synopsis "An Optimal Algorithm to Find Minimum K-hop Dominating Set"

Domination in graphs has been an extensively researched branch of graph theory. Among the variations of dominations, k-hop domination has been briefly discussed in the past and it has important applications in communication networks.In this book, we consider the problem of finding a minimum k-hop dominating set of interval graphs. For this purpose, we first construct the BFS-tree T with root as 1. After then we identify the main path of the BFS-tree T. Next we find the first member of k-hop dominating set of interval graph, by using some results. Then we find the next member of k-hop dominating set by a procedure FindNext. Here, we proposed an O(n) time algorithm to find a minimum k-hop dominating set of undirected and connected interval graphs with n vertices

Customers reviews

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews