Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/dm/HsuN81
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/dm/HsuN81
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/George_L._Nemhauser
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Wen-Lian_Hsu
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2F0012-365X%2881%2990218-1
>
foaf:
homepage
<
https://doi.org/10.1016/0012-365X(81)90218-1
>
dc:
identifier
DBLP journals/dm/HsuN81
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2F0012-365X%2881%2990218-1
(xsd:string)
dcterms:
issued
1981
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/dm
>
rdfs:
label
Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/George_L._Nemhauser
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Wen-Lian_Hsu
>
swrc:
number
2-3
(xsd:string)
swrc:
pages
181-191
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/dm/HsuN81/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/dm/HsuN81
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/dm/dm37.html#HsuN81
>
rdfs:
seeAlso
<
https://doi.org/10.1016/0012-365X(81)90218-1
>
dc:
title
Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
37
(xsd:string)