Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems
The minimum vertex cover (MVC) and maximum independent set (MIS) problems are to be determined in terms of a graph of the small set of vertices, which cover all the edges, and a large set of vertices, no two of which are adjacent. MVC and MIS are notable for its capability of modelling other combina...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Natural Sciences, University of Sindh
2016
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/53852/ http://irep.iium.edu.my/53852/ http://irep.iium.edu.my/53852/1/Max%20Degree%20Around%20Algorithm-A%20Smart%20and%20Efficient%20Approximate%20Algorithm%20for%20Vertex%20Cover%20and%20Independent%20Set%20Problems.pdf |