Open AccessPosted Content
The typical-case complexity of a vertex-covering algorithm on finite-connectivity random graphs
About:
The article was published on 2000-09-27 and is currently open access. It has received 8 citations till now. The article focuses on the topics: Random graph & Vertex (graph theory).read more
Citations
More filters
Proceedings ArticleDOI
Hybrid evolutionary algorithms on minimum vertex cover for random graphs
TL;DR: This paper analyzes the hierarchical Bayesian optimization algorithm (hBOA) on minimum vertex cover for standard classes of random graphs and transformed SAT instances and indicates that mutation- based search and recombination-based search lead to similar performance on the tested problem instances.
Journal ArticleDOI
Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming.
TL;DR: In this article, a linear programming algorithm is applied to the random K-SAT problem, a fundamental problem in computational complexity, to find transitions between phases of different typical hardness of the problems on either side.
Journal ArticleDOI
Phase transition and finite-size scaling in the vertex-cover problem
TL;DR: The phase transition and the running time of an exact algorithm around the phase transition are described and the vertex-cover problem is considered, one of the six “basic” NP-complete problems.
Journal Article
Complete Algorithms on Minimum Vertex -Cover
TL;DR: The results indicate that BB is significantly outperformed by all the other methods, which is expected as BB is a complete search algorithm and minimum vertex cover is an NP-complete problem.
Dissertation
Choosing the Efficient Algorithm for Vertex Cover Problem
K. V. R. Kumar,Deepak Garg +1 more
TL;DR: A chronology of major discoveries, discoveries and publications made during the first half of the 20th century relating to the history of DNA testing and its use in medicine and sport.