Approximating maximum independent sets by excluding subgraphs
- 1 January 1990
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- A better performance guarantee for approximate graph coloringAlgorithmica, 1990
- On the complexity of approximating the independent set problemPublished by Springer Nature ,1989
- Graph products and chromatic numbersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- Ramsey numbers and an approximation algorithm for the vertex cover problemActa Informatica, 1985
- A note on Ramsey numbersJournal of Combinatorial Theory, Series A, 1980
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Determining the Stability Number of a GraphSIAM Journal on Computing, 1977
- Some remarks on chromatic graphsColloquium Mathematicum, 1967