Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Kinsley, A. Anto"'
Publikováno v:
In Procedia Computer Science 2015 47:342-350
Autor:
Annie Vetha V. Joeshi, Kinsley A. Anto
Publikováno v:
Journal of Physics: Conference Series. 1770:012073
Let D = (V, A) be a finite and simple directed graph (digraph) with vertex set V and arc set A. For an integer k ≥ 1, the out k-neighborhood of a vertex ν is defined as N k + ( ν ) = { u ∈ V ( D ) / d → ( ν , u ) ≤ k } . A set S ⊆ V is s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::584634f0a1119724cabf70176ab5355b
https://doi.org/10.1088/1742-6596/1770/1/012073
https://doi.org/10.1088/1742-6596/1770/1/012073
Publikováno v:
AIP Conference Proceedings; 2020, Vol. 2261 Issue 1, p1-5, 5p
Publikováno v:
AIP Conference Proceedings; 2020, Vol. 2261 Issue 1, p1-6, 6p
Publikováno v:
AIP Conference Proceedings; 2020, Vol. 2261 Issue 1, p1-9, 9p