<--- Back to Details
First PageDocument Content
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
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

Similar Documents

Edsger W. Dijkstra / Network theory / Shortest path problem / Constructible universe / Total least squares

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

PDF Document

DocID: 1xkJU - View Document

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document