Two Approaches to Constructing Certified Dominating Sets in Social Networks
Social networks are an important part of our community. In this context, certified dominating sets help to find in networks a group of people, referring as officials, such that 1) for each civilian, there is an official that can serve the civilian, and 2) no official is adjacent to exactly one civil...
Saved in:
Main Authors: | Joanna Raczek, Mateusz Miotk |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2025-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10848090/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Complexity of Computation of Dominating Sets in Geo-Mathmetics Algorithm : A Review
by: Şakir Işleyen
Published: (2021-02-01) -
Co-Secure Domination Number in Some Graphs
by: Jiatong Cui, et al.
Published: (2024-12-01) -
On Roman balanced domination of graphs
by: Mingyu Zhang, et al.
Published: (2024-12-01) -
Perfectness of the essential graph for modules over commutative rings
by: Fatemeh Soheilnia, et al.
Published: (2025-02-01) -
Multi-Objective Task Scheduling for Earth Observation InSAR Satellites via Non-Dominated Sorting Student Psychology Based Optimization Algorithm
by: Qingxian Jia, et al.
Published: (2025-02-01)