A note on greedy algorithms for the maximum weighted independent set problem
Discrete Applied Mathematics
GreedyMAX-type algorithms for the maximum independent set problem
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
The potential of greed for independence
Journal of Graph Theory
Note: A new lower bound on the independence number of graphs
Discrete Applied Mathematics
Hi-index | 0.05 |