3471 search results - page 230 / 695 » Obstacle Numbers of Graphs |
162
click to vote
IJSNET
2007
15 years 5 months ago
2007
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
121
Voted
JGT
2007
15 years 5 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
141
click to vote
TPDS
2008
15 years 5 months ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
190
click to vote
GLOBECOM
2010
IEEE
15 years 2 months ago
2010
IEEE
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
145
Voted
ESA
2008
Springer
15 years 6 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...