Approximating Maximum Independent Set in k-Clique-Free Graphs. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/approx/Schiermeyer98>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Ingo_Schiermeyer>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2FBFb0053972>
foaf:homepage	<https://doi.org/10.1007/BFb0053972>
dc:identifier	DBLP conf/approx/Schiermeyer98 (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2FBFb0053972 (xsd:string)
dcterms:issued	1998 (xsd:gYear)
rdfs:label	Approximating Maximum Independent Set in k-Clique-Free Graphs. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Ingo_Schiermeyer>
swrc:pages	159-168 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/approx/1998>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/approx/Schiermeyer98/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/approx/Schiermeyer98>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/approx/approx1998.html#Schiermeyer98>
rdfs:seeAlso	<https://doi.org/10.1007/BFb0053972>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/approx>
dc:subject	Graph, Maximum Independent Set, k-Clique, Algorithm, Complexity, Approximation (xsd:string)
dc:title	Approximating Maximum Independent Set in k-Clique-Free Graphs. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document