An O(n)-time algorithm for the paired domination problem on permutation graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/ejc/LappasNP13
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/ejc/LappasNP13
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Evaggelos_Lappas
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Leonidas_Palios
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Stavros_D._Nikolopoulos
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.ejc.2011.10.011
>
foaf:
homepage
<
https://doi.org/10.1016/j.ejc.2011.10.011
>
dc:
identifier
DBLP journals/ejc/LappasNP13
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.ejc.2011.10.011
(xsd:string)
dcterms:
issued
2013
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/ejc
>
rdfs:
label
An O(n)-time algorithm for the paired domination problem on permutation graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Evaggelos_Lappas
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Leonidas_Palios
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Stavros_D._Nikolopoulos
>
swrc:
number
3
(xsd:string)
swrc:
pages
593-608
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/ejc/LappasNP13/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/ejc/LappasNP13
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/ejc/ejc34.html#LappasNP13
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.ejc.2011.10.011
>
dc:
title
An O(n)-time algorithm for the paired domination problem on permutation graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
34
(xsd:string)