共 50 条
- [32] Greed is good: Approximating independent sets in sparse and bounded-degree graphs Algorithmica, 1997, 18 : 145 - 163
- [35] A lower bound for testing 3-colorability in bounded-degree graphs FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 93 - 102
- [37] Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs Algorithmica (New York), 1997, 18 (01): : 145 - 163