Cargando…
Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks
A dominating set of a graph [Formula: see text] is a subset U of its vertices V, such that any vertex of G is either in U, or has a neighbor in U. The dominating-set problem is to find a minimum dominating set in G. Dominating sets are of critical importance for various types of networks/graphs, and...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Nature Publishing Group UK
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10015031/ https://www.ncbi.nlm.nih.gov/pubmed/36918570 http://dx.doi.org/10.1038/s41598-023-30600-4 |