{"title":"The Maximum Distance-d Independent Set Problem on Unit Disk Graphs","authors":"S. Jena, Ramesh K. Jallu, G. Das, S. Nandy","doi":"10.1007/978-3-319-78455-7_6","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Frontiers in Algorithmics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-78455-7_6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
