4865 search results - page 328 / 973 » The Complexity of Graph Connectivity |
164
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
186
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
189
click to vote
ESAS
2006
Springer
15 years 10 months ago
2006
Springer
We derive the optimality results for key pre distribution scheme for distributed sensor networks, and relations between interesting parameters. Namely, given a key-pool of size n ...
190
click to vote
USS
2008
15 years 9 months ago
2008
Provenance describes how an object came to be in its present state. Intelligence dossiers, medical records and corporate financial reports capture provenance information. Many of ...
217
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...