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

First Page		Document Content
Date: 2007-11-29 01:16:09 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		Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks Add to Reading List Source URL: www.hicss.hawaii.edu Download Document from Source Website File Size: 184,47 KB Share Document on Facebook

	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 DocID: 1ojNc - View Document
	Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch DocID: 1lNO5 - View Document
	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 DocID: 1lFOT - View Document
	Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States DocID: 1a69s - View Document
	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 DocID: 18WIc - View Document