Algorithm for Finding Minimum Dominating Set Using Sticker Based Model in DNA Computing

V. Sudha () and K. S. Easwarakumar
Additional contact information
V. Sudha: Kumaraguru College of Technology
K. S. Easwarakumar: Anna University, Department of Computer Science and Engineering

A chapter in New Trends in Computational Vision and Bio-inspired Computing, 2020, pp 283-288 from Springer

Abstract: Abstract Dominating set problem is a famous problem that finds applications in many fields. In this paper, an algorithm based on DNA Computing sticker-based model is proposed for finding dominating set in a given graph. Here, initially solution space containing all possible dominating sets of a graph is constructed and then the solution space is filtered iteratively until the desired solution set is obtained. Along with the operations in the sticker-based model, operations defined for DNA computer sticker-based model ALU is used.

Keywords: DNA computation; Dominating set; Sticker based model (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-41862-5_26

Ordering information: This item can be ordered from
http://www.springer.com/9783030418625

DOI: 10.1007/978-3-030-41862-5_26

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().