Greed is good: approximating independent sets in sparse and bounded-degree graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
Improved approximations of independent sets in bounded-degree graphs via subgraph removal
Nordic Journal of Computing
Large independent sets in regular graphs of large girth
Journal of Combinatorial Theory Series B
Combinatorics, Probability and Computing
Note: Independence in connected graphs
Discrete Applied Mathematics
Lower bounds on the independence number of certain graphs of odd girth at least seven
Discrete Applied Mathematics
Hi-index | 0.00 |