基于自稳定的网络图防御和进攻联盟分布式协议

2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI:10.1109/ICCTA.2007.54

P. Srimani, Zhenyu Xu

{"title":"基于自稳定的网络图防御和进攻联盟分布式协议","authors":"P. Srimani, Zhenyu Xu","doi":"10.1109/ICCTA.2007.54","DOIUrl":null,"url":null,"abstract":"Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorithms for the global offensive and the global defensive alliance in a given arbitrary graph. We also provide complete analysis of the convergence time of both the algorithms","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Distributed Protocols for Defensive and Offensive Alliances in Network Graphs Using Self-Stabilization\",\"authors\":\"P. Srimani, Zhenyu Xu\",\"doi\":\"10.1109/ICCTA.2007.54\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorithms for the global offensive and the global defensive alliance in a given arbitrary graph. We also provide complete analysis of the convergence time of both the algorithms\",\"PeriodicalId\":308247,\"journal\":{\"name\":\"2007 International Conference on Computing: Theory and Applications (ICCTA'07)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Computing: Theory and Applications (ICCTA'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCTA.2007.54\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTA.2007.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 18

摘要

图联盟是最近发展起来的任意对称图的全局属性。在本文中，我们的目的是在给定的任意图中设计全局进攻和全局防御联盟的自稳定容错分布式算法。我们还对两种算法的收敛时间进行了完整的分析

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Distributed Protocols for Defensive and Offensive Alliances in Network Graphs Using Self-Stabilization

Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorithms for the global offensive and the global defensive alliance in a given arbitrary graph. We also provide complete analysis of the convergence time of both the algorithms

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 International Conference on Computing: Theory and Applications (ICCTA'07)

自引率

0.00%

发文量