Connected Dominating Set in Graphs Without Long Paths And Cycles Eglantine Camby1 and Oliver Schaudt2 1 D´epartement de Math´ematique, Universit´e Libre de Bruxelles, Boulevard du Triomphe, 1050

Source URL: homepages.ulb.ac.be

Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch

Source URL: www.tik.ee.ethz.ch

• NP-complete problems
• Dominating set
• Approximation algorithm
• Domination
• Connected dominating set
• Domatic number

Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Dominating set
• Independent set
• Vertex cover
• Connected dominating set
• Set cover problem
• Line graph
• Metric k-center
• Domatic number

Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States

Source URL: www.normalesup.org

• NP-complete problems
• Cluster analysis
• Correlation clustering
• Graph
• Minor
• Planar graph
• Dominating set
• Independent set
• Matroid theory
• Graph theory
• Mathematics
• Theoretical computer science

CCCG 2010, Winnipeg MB, August 9–11, 2010 3D Local Algorithm for Dominating Sets of Unit Disk Graphs A.E. Abdallah and T. Fevens and J. Opatrny∗ Abstract

Source URL: cccg.ca

• Deltahedra
• Octahedron
• Connected dominating set
• Dominating set
• Dominator
• Routing
• Truncated octahedron
• Tree
• Geometry
• Convex geometry
• Theoretical computer science

Comparison of Two CDS Algorithms on Random Unit Ball Graphs Jennie C. Hansen∗ Abstract This paper compares asymptotic “average case”performance of two closely related algorithms for finding small connected dominati

Source URL: www.siam.org

• Applied mathematics
• NP-complete problems
• Dominating set
• Random graph
• Connectivity
• Graph
• Theoretical computer science
• Mathematics
• Graph theory

Distributed Connected Dominating Set Techniques for Energy-Efficient Topology Control in Wireless Sensor Networks A thesis submitted for the degree of

Source URL: titania.ctie.monash.edu.au

• Network topology
• Topology control
• Electronics
• Electromagnetism
• Algorithm
• Topology
• ANT
• Wireless sensor network
• Technology
• Wireless networking

Dominating Sets in Directed Graphs Chaoyi Pang a,∗ Rui Zhang b Qing Zhang a Junhu Wang c a The Australian e-Health Research Centre, ICT Centre, CSIRO, Australia

Source URL: www.ruizhang.info

• NP-complete problems
• Dominating set
• Directed graph
• Group action
• Connected dominating set
• Domatic number
• Graph theory
• Theoretical computer science
• Mathematics

Multipoint Relay and Connected Dominating Set Based Broadcast Algorithms for Wireless Ad Hoc Networks Ou Liang

Source URL: titania.ctie.monash.edu.au

• Technology
• Network architecture
• Routing
• Wireless ad-hoc network
• Flooding
• Multipoint relay
• Mobile ad hoc network
• Algorithm
• Optimized Link State Routing Protocol
• Wireless networking
• Routing algorithms
• Wireless

Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks

Source URL: www.hicss.hawaii.edu

• NP-complete problems
• Distributed data storage
• Networks
• Dominating set
• Connected dominating set
• Chord
• Connectivity
• Unit disk graph
• Tree decomposition
• Graph theory
• Theoretical computer science
• Mathematics