4171 search results - page 241 / 835 » Choice numbers of graphs |
174
Voted
ENDM
2007
15 years 6 months ago
2007
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...
196
click to vote
IJSNET
2007
15 years 6 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...
149
click to vote
JGT
2007
15 years 6 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...
168
click to vote
TPDS
2008
15 years 6 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...
223
click to vote
GLOBECOM
2010
IEEE
15 years 4 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 ...