Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Matteo Dell'Orefice"'
Publikováno v:
Theoretical Computer Science. 764:2-14
A locally connected spanning tree (LCST) T of a graph G is a spanning tree of G such that, for each node, its neighborhood in T induces a connected subgraph in G. The problem of determining whether a graph contains an LCST or not has been proved to b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb3bce2aefcb4390644eb25c3ddbc9fb
https://doi.org/10.1016/j.tcs.2018.02.025
https://doi.org/10.1016/j.tcs.2018.02.025
