<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / NP-complete problems / Edsger W. Dijkstra / Routing algorithms / Network theory / Unit disk graph / Search algorithms / Connectivity / Topology control / Independent set / Dominating set
Date: 2015-05-18 12:15:52
Graph theory
Mathematics
NP-complete problems
Edsger W. Dijkstra
Routing algorithms
Network theory
Unit disk graph
Search algorithms
Connectivity
Topology control
Independent set
Dominating set

Sensor Networks Continue to Puzzle: Selected Open Problems Thomas Locher, Pascal von Rickenbach, and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland {lochert, pascalv, wattenhofer}

Add to Reading List

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

Download Document from Source Website

File Size: 159,66 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