Average-case complexity of a branch-and-bound algorithm for min dominating set
classification
💻 cs.DS
keywords
average-casebranch-and-boundcomplexitydominatingalgorithmalgorithmscomplexitiesdepending
read the original abstract
The average-case complexity of a branch-and-bound algorithms for Minimum 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.