- Record: found
- Abstract: not found
- Article: not found
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
Read this article at
ScienceOpenPublisher
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Abstract
Related collections
Most cited references16
- Record: found
- Abstract: not found
- Article: not found
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
John Hopcroft, Richard M Karp (1973)
- Record: found
- Abstract: not found
- Article: not found
Optimization, approximation, and complexity classes
- Record: found
- Abstract: not found
- Article: not found
Locality in Distributed Graph Algorithms
Nathan Linial (1992)