Geodesic
On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups
Discrete mathematics & theoretical computer science, Tome 15 (2013) no. 3 Cet article a éte moissonné depuis la source Episciences

Voir la notice de l'article

Distributed Computing and Networking 
@article{DMTCS_2013_15_3_a10,
     author = {Kowalski, Dariusz and Krzywdzi\'nski, Krzysztof},
     title = {On the complexity of distributed {BFS} in ad hoc networks with non-spontaneous wake-ups},
     journal = {Discrete mathematics & theoretical computer science},
     year = {2013},
     volume = {15},
     number = {3},
     doi = {10.46298/dmtcs.622},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.622/}
}
TY  - JOUR
AU  - Kowalski, Dariusz
AU  - Krzywdziński, Krzysztof
TI  - On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups
JO  - Discrete mathematics & theoretical computer science
PY  - 2013
VL  - 15
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.622/
DO  - 10.46298/dmtcs.622
LA  - en
ID  - DMTCS_2013_15_3_a10
ER  - 
%0 Journal Article
%A Kowalski, Dariusz
%A Krzywdziński, Krzysztof
%T On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups
%J Discrete mathematics & theoretical computer science
%D 2013
%V 15
%N 3
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.622/
%R 10.46298/dmtcs.622
%G en
%F DMTCS_2013_15_3_a10
Kowalski, Dariusz; Krzywdziński, Krzysztof. On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups. Discrete mathematics & theoretical computer science, Tome 15 (2013) no. 3. doi: 10.46298/dmtcs.622

Cité par Sources :