{"product_id":"an-optimal-algorithm-to-find-minimum-k-hop-dominating-set-on-interval-graphs-von-sukumar-mondal-madhumangal-pal","title":"An Optimal Algorithm to Find Minimum K-hop Dominating Set","description":"\u003cp\u003eDomination 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.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9786200248572\"\u003e\u003ch3\u003eon Interval Graphs\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Softcover - 9786200248572","offer_id":39464493973597,"sku":"9786200248572","price":39.9,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/246b52f6-b042-47f6-9204-3b2d5d0b1523.jpg?v=1757483994","url":"https:\/\/shop.autorenwelt.de\/products\/an-optimal-algorithm-to-find-minimum-k-hop-dominating-set-on-interval-graphs-von-sukumar-mondal-madhumangal-pal","provider":"Autorenwelt Shop","version":"1.0","type":"link"}