Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems-Reference-Cited by-同舟云学术

Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems

Published:2014 Issue: Volume: Page:307-322
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Delbot François,Laforest Christian,Rovedakis Stephane

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-14472-6_21

Reference48 articles.

1. Lecture Notes in Computer Science;F.M. Al-Azemi,2011

2. Bein, D., Datta, A.K., Jagganagari, C.R., Villain, V.: A self-stabilizing link-cluster algorithm in mobile ad hoc networks. In: 8th Int. Symp. on Parallel Architectures, Algorithms, and Networks, pp. 436–441 (2005)

3. Belkouch, F., Bui, M., Chen, L., Datta, A.K.: Self-stabilizing deterministic network decomposition. J. Parallel Distrib. Comput. 62(4), 696–714 (2002)

4. Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected Dominating Set in Sensor Networks and MANETs. Springer US (2005)

5. Lecture Notes in Computer Science;J. Burman,2007

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

1. Self-Stabilizing Domination Algorithms;Developments in Mathematics;2020-09-15

2. A O(m) Self-Stabilizing Algorithm for Maximal Triangle Partition of General Graphs;Parallel Processing Letters;2017-06

3. The price of connectivity for cycle transversals;European Journal of Combinatorics;2016-11

4. On Vertex Cover Problems in Distributed Systems;Advanced Methods for Complex Network Analysis;2016

5. Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems;Lecture Notes in Computer Science;2014