Chapter 4 Partition I. Covering and Dominating. Unit Disk Covering Given a set of n points in the Euclidean plane, find the minimum number of unit disks.
Dominating Sets, Multiple Egocentric Networks and Modularity Maximizing Clustering of Social Networks. By M.A. Boudourides & S.T. Lenis
Short version of Dominating Sets, Multiple Egocentric Networks and Modularity Maximizing Clustering of Social Networks. By M.A. Boudourides & S.T. Lenis
Topics of Complex Social Networks: Domination, Influence and Assortativity
Connected Dominating Set Text
1 Randomized k-Coverage Algorithms for Dense Sensor Networks Mohamed Hefeeda, Majid Bagheri School of Computing Science, Simon Fraser University, Canada.
Architectures and Algorithms for Resource Allocation Mounire El Houmaidi *, Mostafa A. Bassiouni *, and Guifang Li # * School of Electrical Engineering.
1 Constant Density Spanners for Wireless Ad-Hoc Networks Discrete Mathematics and Algorithms Seminar Melih Onus April 5 2005.
Topology Management
Chapter 4 Partition
Architectures and Algorithms for Resource Allocation
Konstantin Avrachenkov (INRIA) Prithwish Basu (BBN) Giovanni Neglia (INRIA) Bruno Ribeiro (CMU) Don Towsley (UMass Amherst) 1 K. Avrachenkov, P. Basu,