2022
DOI: 10.1155/2022/1818734
|View full text |Cite
|
Sign up to set email alerts
|

Minimal Doubly Resolving Sets of Some Classes of Convex Polytopes

Abstract: Source localization is one of the most challenging problems in complex networks. Monitoring and controlling complex networks is of great interest for understanding different types of systems, such as biological, technological, and complex physical systems. Modern research has made great developments in identifying sensors through which we can monitor or control complex systems. For this task, we choose a set of sensors with the smallest possible size so that the source may be identified. The problem of locatin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 32 publications
0
1
0
Order By: Relevance
“…The problems of MD and MDRS for cocktail party networks and jellyfish networks have been investigated in [34]. Moreover, the generalized results for the DMD problem of certain convex polytope structures were derived by Ahmad et al [35], [36].…”
Section: Introductionmentioning
confidence: 99%
“…The problems of MD and MDRS for cocktail party networks and jellyfish networks have been investigated in [34]. Moreover, the generalized results for the DMD problem of certain convex polytope structures were derived by Ahmad et al [35], [36].…”
Section: Introductionmentioning
confidence: 99%