{"title":"大型网络图中完美邻域集的自稳定计算","authors":"Yihua Ding, J. Wang, P. Srimani","doi":"10.1109/WI.2016.0069","DOIUrl":null,"url":null,"abstract":"Given a graph G = (V, E), a node is called perfect (with respect to a set S ⊆ V) if its closed neighborhood contains exactly one node in set S, a node is called nearly perfect if it is not perfect but is adjacent to a perfect node. S is called a perfect neighborhood set if each node is either perfect or nearly perfect. We present the first self-stabilizing algorithm for computing a perfect neighborhood set in an arbitrary graph. This anonymous, constant space algorithm terminates in O(n2) steps using an unfair central daemon, where n is the number of nodes in the graph.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"2 1","pages":"435-438"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Self-Stabilizing Computation of Perfect Neighborhood Set in Large Network Graphs\",\"authors\":\"Yihua Ding, J. Wang, P. Srimani\",\"doi\":\"10.1109/WI.2016.0069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a graph G = (V, E), a node is called perfect (with respect to a set S ⊆ V) if its closed neighborhood contains exactly one node in set S, a node is called nearly perfect if it is not perfect but is adjacent to a perfect node. S is called a perfect neighborhood set if each node is either perfect or nearly perfect. We present the first self-stabilizing algorithm for computing a perfect neighborhood set in an arbitrary graph. This anonymous, constant space algorithm terminates in O(n2) steps using an unfair central daemon, where n is the number of nodes in the graph.\",\"PeriodicalId\":6513,\"journal\":{\"name\":\"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)\",\"volume\":\"2 1\",\"pages\":\"435-438\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WI.2016.0069\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI.2016.0069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Self-Stabilizing Computation of Perfect Neighborhood Set in Large Network Graphs
Given a graph G = (V, E), a node is called perfect (with respect to a set S ⊆ V) if its closed neighborhood contains exactly one node in set S, a node is called nearly perfect if it is not perfect but is adjacent to a perfect node. S is called a perfect neighborhood set if each node is either perfect or nearly perfect. We present the first self-stabilizing algorithm for computing a perfect neighborhood set in an arbitrary graph. This anonymous, constant space algorithm terminates in O(n2) steps using an unfair central daemon, where n is the number of nodes in the graph.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
