C. Barrett, V. S. A. Kumar, M. Marathe, Shripad Thite, Gabriel Istrate
{"title":"Strong edge coloring for channel assignment in wireless radio networks","authors":"C. Barrett, V. S. A. Kumar, M. Marathe, Shripad Thite, Gabriel Istrate","doi":"10.1109/PERCOMW.2006.129","DOIUrl":null,"url":null,"abstract":"We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"291 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"84","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERCOMW.2006.129","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 84
Abstract
We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
