Efficiently implementing maximum independent set algorithms on circle graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jea/NashLG08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jea/NashLG08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/David_Gregg
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nicholas_Nash
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sylvain_Lelait
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1412228.1455265
>
foaf:
homepage
<
https://doi.org/10.1145/1412228.1455265
>
dc:
identifier
DBLP journals/jea/NashLG08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1412228.1455265
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jea
>
rdfs:
label
Efficiently implementing maximum independent set algorithms on circle graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/David_Gregg
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nicholas_Nash
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sylvain_Lelait
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jea/NashLG08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jea/NashLG08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jea/jea13.html#NashLG08
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1412228.1455265
>
dc:
subject
Circle graph, maximum independent set, maximum stable set
(xsd:string)
dc:
title
Efficiently implementing maximum independent set algorithms on circle graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
13
(xsd:string)