Minimum Vertex Cut with Reachable Set (MVCRS) Problem for Suppressing Botnet Propagation in IoT Networks: Complexity and Algorithms.

Yamaguchi S

Open source

DOI
10.3390/s26082324
Published
2026 Apr 9
Container
Sensors (Basel, Switzerland)
Publisher
Not recorded
Open access
yes

Credibility signals

uncertain Score 53/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.3390/s26082324,
  title = {Minimum Vertex Cut with Reachable Set (MVCRS) Problem for Suppressing Botnet Propagation in IoT Networks: Complexity and Algorithms.},
  author = {Yamaguchi S},
  year = {2026},
  journal = {Sensors (Basel, Switzerland)},
  doi = {10.3390/s26082324},
  url = {https://doi.org/10.3390/s26082324}
}

RIS

TY  - JOUR
TI  - Minimum Vertex Cut with Reachable Set (MVCRS) Problem for Suppressing Botnet Propagation in IoT Networks: Complexity and Algorithms.
AU  - Yamaguchi S
PY  - 2026
JO  - Sensors (Basel, Switzerland)
DO  - 10.3390/s26082324
UR  - https://doi.org/10.3390/s26082324
ER  - 

APA

S, Y. (2026). Minimum Vertex Cut with Reachable Set (MVCRS) Problem for Suppressing Botnet Propagation in IoT Networks: Complexity and Algorithms.. Sensors (Basel, Switzerland). https://doi.org/10.3390/s26082324

Source records