A localized distributed algorithm for vertex cover problem-Reference-Cited by-同舟云学术

A localized distributed algorithm for vertex cover problem

Published:2022-02 Issue: Volume:58 Page:101518
ISSN:1877-7503
Container-title:Journal of Computational Science
language:en
Short-container-title:Journal of Computational Science

Author:

Akram Vahid Khalilpour^ORCID,Ugurlu Onur

Publisher

Elsevier BV

Subject

Modeling and Simulation,General Computer Science,Theoretical Computer Science

Reference32 articles.

1. On the hardness of approximating minimum vertex cover;Dinur;Ann. of Math.,2005

2. The vertex cover game: Application to transport networks;Gusev;Omega,2019

3. Fault tolerance performance of self-stabilizing independent set algorithms on a covering-based problem: The case of link monitoring in wsns;Yigit,2018

4. Capacitated vertex covering;Guha;J. Algorithms,2003

5. On the approximate compressibility of connected vertex cover;Majumdar;Algorithmica,2020

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Adaptive Cooperative Caching Strategy for Vehicular Networks;IEEE Transactions on Mobile Computing;2024-10

2. Efficient Application Image Management in the Compute Continuum: A Vertex Cover Approach Based on the Think-Like-A-Vertex Paradigm;2024 IEEE 17th International Conference on Cloud Computing (CLOUD);2024-07-07

3. Tree Topologies and Node Covers for Efficient Communication in Wireless Sensor Networks;Communications in Computer and Information Science;2024

4. Application of Minimum Vertex Cover Problem in Functional Brain Connectivity Graphs;2023 Innovations in Intelligent Systems and Applications Conference (ASYU);2023-10-11

5. A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithm;The Journal of Supercomputing;2023-06-03