Proceedings ArticleDOI
An Improved Greedy Heuristic for Unweighted Minimum Vertex Cover
Dhananjay Tomar
- pp 618-622
Reads0
Chats0
TLDR
The results have shown that the proposed algorithm can yield better solutions especially on dense graphs for solving the minimum vertex cover problem.Abstract:
The minimum vertex cover (MVC) problem is a well-studied NP-Complete problem and has various applications. In this paper, a new heuristic approach has been proposed to find the minimum vertex cover of a graph. The proposed algorithm has been tested on random graphs and BHOSLIB instances. The results have shown that the proposed algorithm can yield better solutions especially on dense graphs for solving the minimum vertex cover problem.read more
Citations
More filters
Proceedings ArticleDOI
Random graphs
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Journal ArticleDOI
On the Optimal Lawful Intercept Access Points Placement Problem in Hybrid Software-Defined Networks
TL;DR: In this paper, the authors proposed an improved equal-cost multi-path shortest path algorithm and accordingly proposed three SDN interception models: T interception model, ECMP-T interception model and Fermat-point interception model.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Book ChapterDOI
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.