28 search results - page 6 / 6 » Neighbour-Distinguishing Edge Colourings of Random Regular G... |
SODA
2007
ACM
13 years 10 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
ALGOSENSORS
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...