Average-case complexity of a branch-and-bound algorithm for MIN DOMINATING SET

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F24%3A00372765" target="_blank" >RIV/68407700:21240/24:00372765 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1016/j.dam.2023.11.021" target="_blank" >https://doi.org/10.1016/j.dam.2023.11.021</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.dam.2023.11.021" target="_blank" >10.1016/j.dam.2023.11.021</a>

Result language

angličtina

Original language name

Average-case complexity of a branch-and-bound algorithm for MIN DOMINATING SET

Original language description

The average-case complexity of a branch-and-bound algorithm for MIN DOMINATING SET problem in random graphs in the G(n, p) model is studied. We identify phase transitions between subexponential and exponential average-case complexities, depending on the growth of the probability p with respect to the number n of nodes. (c) 2023 Elsevier B.V. All rights reserved.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2024

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Discrete Applied Mathematics

ISSN

0166-218X

e-ISSN

1872-6771

Volume of the periodical

345

Issue of the periodical within the volume

March

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

5

Pages from-to

4-8

UT code for WoS article

001119037800001

EID of the result in the Scopus database

2-s2.0-85177228255