Note: Independence in connected graphs
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
A lower bound on independence in terms of degrees
Discrete Applied Mathematics
Discrete Applied Mathematics
Partitions of graphs into small and large sets
Discrete Applied Mathematics
Hi-index | 0.05 |