New Algorithms for Minimum Dominating Set in Any Graphs

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Bilgisayar Bilimleri
Volume:5 Issue:2
New Algorithms for Minimum Dominating Set in Any Graphs

New Algorithms for Minimum Dominating Set in Any Graphs

Authors : Ali KARCİ

Pages : 62-70

View : 36 | Download : 7

Publication Date : 2020-12-01

Article Type : Research Paper

Abstract :There are many NP-hard and NP-complete problems in graph theory. The aim of this paper is to solve minimum dominating set problem which is an NP-hard and NP-Complete problem. At this aim, there is a new type spanning tree for given graph, and the fundamental cut-sets of graph are constructed by using this spanning tree. The cut-sets and spanning tree constitute the basic building blocks for algorithms will be proposed in this study.
Keywords : Dominating Sets, Fundamental Cut Sets, Efficient Algorithms

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.

Index of Academic Documents
İzmir Academy Association
CopyRight © 2023-2026