Approximating maximum independent sets by excluding subgraphs
- 1 June 1992
- journal article
- algorithm theory
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 32 (2) , 180-196
- https://doi.org/10.1007/bf01994876
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the complexity of approximating the independent set problemInformation and Computation, 1992
- A better performance guarantee for approximate graph coloringAlgorithmica, 1990
- Approximating maximum independent sets by excluding subgraphsPublished by Springer Nature ,1990
- An O(n0.4)-approximation algorithm for 3-coloringPublished by Association for Computing Machinery (ACM) ,1989
- Graph products and chromatic numbersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Ramsey numbers and an approximation algorithm for the vertex cover problemActa Informatica, 1985
- A note on the independence number of triangle-free graphsDiscrete Mathematics, 1983
- A note on Ramsey numbersJournal of Combinatorial Theory, Series A, 1980
- Determining the Stability Number of a GraphSIAM Journal on Computing, 1977
- Some remarks on chromatic graphsColloquium Mathematicum, 1967