1 |
N. Apollonio and B. Simeone, "The Maximum Vertex Coverage Problem on Bipartite Graphs," Discrete Applied Mathematics, Vol. 165, pp. 37-48, Mar. 2014, doi:10.1016/j.dam.2013.05.015
DOI
|
2 |
S. Richter, M. Helmert, and C. Gretton, "A Stochastic Local Search Approach to Vertex Cover," Annual Conference on Artificial Intelligence, Lecture Notes in Computer Science, Vol. 4667, pp. 412-426, 2007, doi:10.1007/978-3-540- 74565-5_31
|
3 |
R. M. Karp, "Reducibility Among Combinatorial Problems," Complexity of Computer Computations, pp. 85-103, 1972, doi:10.1007/978-1-4684- 2001-2_9
|
4 |
M. Xiao anf H. Nagamochi, "Exact Algorithms for Maximum Independent Set," Information and Computation, Vol. 255, No. 1, pp. 126-146, Aug. 2017, doi:10.1016/j.ic.2017.06.001
DOI
|
5 |
M. Xiao,"A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs," International Workshop on Algorithms and Computation, pp. 281-292, 2010, doi:10.1007/ 978-3-642-11440-3_26
|
6 |
M. H. Dahshan, "Maximum Independent Set Approximation Based on Bellman-Ford Algorithm," Arabian Journal for Science and Engineering, Vol. 39, No. 10, pp. 7003-7011, Oct. 2014, doi:10.1007/s13369-014-1159-7
DOI
|
7 |
P. Borowiecki and F. Goring, "GreedyMAX-type Algorithms for the Maximum Independent Set Problem," International Conference on Current Trends in Theory and Practice of Computer Science, pp. 146-156, 2011, doi:10.1007/978-3 -642-18381-2_12
|
8 |
E. Losievskaja, "Approximation Algorithms for Independent Set Problems on Hypergraphs," Ph. D. Desertation, School of Computer Science, Reykjavik University, Dec. 2009.
|
9 |
N. C. Le, C. Brause and I. Schiermeyer, "On Sequential Heuristic Methods for the Maximum Independent Set Problem," Discussiones Mathematicae Graph Theory, pp. 1-12, Feb. 2017, doi:0.7151/dmgt.1965
|
10 |
I. V. Olemskoy and O. S. Firyulina, "Modification of Robson's Algorithm for Finding Maximum Independent Set in Undirected Graph," 2015 International Conference "Stability and Control Processes, pp. 1-3, Dec. 2015, doi:10.1109/ SCP.2015.7342131
|
11 |
D, V, Andrade, M, G. C. Resende, R, F. Werneck, "Fast Local Search for the Maximum Independent Set Problem," Journal of Heuristics, Vol. 18, No. 4, pp. 525-547, Aug. 2012, doi:10.1007/s10732-012-9196-4
DOI
|
12 |
A. Brændeland, "A Family of Greedy Algorithms for Finding Maximum Independent Sets," Cornell University Library, arXiv:1505.00752, pp. 1-4, May 2015.
|
13 |
M. Ghaffari, "An Improved Distributed Algorithm for Maximal Independent Set," Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 270-277, Jan. 2016, ISBN:978-1-611974-33-1
|
14 |
J. M. Byskov, 'Enumerating Maximal Independent Sets with Applications to Graph Colouring," Operations Research Letters, Vol. 32, No. 6, pp. 547-556, Nov. 2004, doi:10.1016/j.orl.2004.03.002
DOI
|
15 |
A. Sharich, W. A. Rawagepfeh, M. H. Mahafzah, and A. A. Dahamsheh, "An Algorithm for Finding Maximum Independent Set in a Graph," European Journal of Scientific Research, Vol. 23, No. 4, pp. 586-596, Nov. 2008, ISSN:1450-216X
|