Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks
Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks
About this item
Full title
Author / Creator
Publisher
London: Nature Publishing Group UK
Journal title
Language
English
Formats
Publication information
Publisher
London: Nature Publishing Group UK
Subjects
More information
Scope and Contents
Contents
A dominating set of a graph
G
=
(
V
,
E
)
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/gra...
Alternative Titles
Full title
Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_c561994022764ec4999e6ef822c451bc
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_c561994022764ec4999e6ef822c451bc
Other Identifiers
ISSN
2045-2322
E-ISSN
2045-2322
DOI
10.1038/s41598-023-30600-4
