Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Kahina Ouazine"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 2, Pp 115-154 (2018)
In practice, an alliance can be a bond or connection between individuals, families, states, or entities, etc. Formally, a non-empty set of vertices of a graph is a defensive -alliance (resp. an offensive -alliance) if every vertex of (resp. the bound
Externí odkaz:
https://doaj.org/article/c42f581c3e6e470b8ae536058537db93
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 2, Pp 115-154 (2018)
In practice, an alliance can be a bond or connection between individuals, families, states, or entities, etc. Formally, a non-empty set S of vertices of a graph G is a defensive k-alliance (resp. an offensive k-alliance) if every vertex of S (resp. t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3eb280a41f4a0358aca98c84502f5332
http://www.sciencedirect.com/science/article/pii/S0972860016301621
http://www.sciencedirect.com/science/article/pii/S0972860016301621
Publikováno v:
2018 International Symposium on Programming and Systems (ISPS).
Vehicular Ad hoc Networks (VANETs) have received special attention from scientists because of their importance in daily life. In VANETs, we mainly find fixed entities (Road Side Units “RSUs”) and mobile entities (vehicles). In order to exchange i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b15f21cf4eff94073ee312bef6f993e
https://doi.org/10.1109/isps.2018.8379003
https://doi.org/10.1109/isps.2018.8379003
Publikováno v:
International Journal of Communication Systems. 33:e4245
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a450ad4b116399f1c8e621badfee8272
https://doi.org/10.1002/dac.4245
https://doi.org/10.1002/dac.4245