Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks

Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks

Dominating sets find application in a variety of networks. A subset of nodes <i>D</i> is a <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>(</mo><mn>1</mn><mo>...

Full description

Bibliographic Details
Main Author: Joanna Raczek
Format: Article
Language:English
Published: MDPI AG 2022-01-01
Series:Electronics
Subjects:
computational complexity
algorithms
domination number
(1,2)-domination number
networks
Online Access:https://www.mdpi.com/2079-9292/11/3/300

Internet

https://www.mdpi.com/2079-9292/11/3/300

Similar Items