Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Joel Helling"'
Publikováno v:
Theoretical Computer Science. 710:88-96
As discussed at length in Christodoulakis et al. (2015) [3] , there is a natural one-many correspondence between simple undirected graphs G with vertex set V = { 1 , 2 , … , n } and indeterminate strings x = x [ 1 . . n ] — that is, sequences of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab53f1de98a51e65566ce5d3e10baa5d
https://doi.org/10.1016/j.tcs.2017.02.016
https://doi.org/10.1016/j.tcs.2017.02.016
