Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ‚Ąď Cliques.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/latin/AlvesCFGKS20
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/latin/AlvesCFGKS20
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Fernanda_Couto
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Lu%E2%88%9A%C2%A9rbio_Faria
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sancrey_Rodrigues_Alves
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sulamita_Klein
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sylvain_Gravier
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/U%E2%88%9A%C2%A9verton_S._Souza
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-030-61792-9%5F46
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-030-61792-9_46
>
dc:
identifier
DBLP conf/latin/AlvesCFGKS20
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-030-61792-9%5F46
(xsd:string)
dcterms:
issued
2020
(xsd:gYear)
rdfs:
label
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ‚Ąď Cliques.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Fernanda_Couto
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Lu%E2%88%9A%C2%A9rbio_Faria
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sancrey_Rodrigues_Alves
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sulamita_Klein
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sylvain_Gravier
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/U%E2%88%9A%C2%A9verton_S._Souza
>
swrc:
pages
587-599
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/latin/2020
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/latin/AlvesCFGKS20/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/latin/AlvesCFGKS20
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/latin/latin2020.html#AlvesCFGKS20
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-030-61792-9_46
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/latin
>
dc:
title
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ‚Ąď Cliques.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document