機(jī)動(dòng)車安全技術(shù)檢驗(yàn)機(jī)構(gòu)檢驗(yàn)-展示頁(yè)
2025-03-07 12:32本頁(yè)面
【正文】 t set, connecting it into cds need at most 4mcds nodes.MCDS (Time)1. In a square of edge length , any node can dominate every bode in the square. Therefore, minimum dominating set has size at most .aMCDS (Time)2. The total size of MCDSs for connected ponents in an inner square area is at most .aMCDS (Size)? Modify a mcds for G into MCDSs in each cell.? mcds(G): mcds for G? mcdscell(inner): MCDS in a cell for connected ponents in inner areaConnect ChargechargeMultiple ChargechargeHow many possiblecharges for each node?How many ponentscan each node be adjacent to? 1. How many independent points can be packed by a disk with radius 1? 115!Each node can be charged at most 10 times!!!Shifting3a/(2(h+1)) = integerTime=n O(a )2h=2Weighted Dominating Set? Given a unit disk graph with vertex weight, find a dominating set with minimum total weight.? Can the partition technique be used for the weighted dominating set problem?Dominating Set in Intersection Disk Graph? An intersection disk graph is given by a set of points (vertices) in the Euclidean plane, each associated with a disk and an edge exists betwe
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號(hào)-1