Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/ai/ChenCWXJY23
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/ai/ChenCWXJY23
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jia_Ji
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jiejiang_Chen
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Minghao_Yin
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Shaowei_Cai_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Wenhao_Xu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yiyuan_Wang
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.artint.2022.103819
>
foaf:
homepage
<
https://doi.org/10.1016/j.artint.2022.103819
>
dc:
identifier
DBLP journals/ai/ChenCWXJY23
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.artint.2022.103819
(xsd:string)
dcterms:
issued
2023
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/ai
>
rdfs:
label
Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jia_Ji
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jiejiang_Chen
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Minghao_Yin
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Shaowei_Cai_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Wenhao_Xu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yiyuan_Wang
>
swrc:
pages
103819
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/ai/ChenCWXJY23/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/ai/ChenCWXJY23
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/ai/ai314.html#ChenCWXJY23
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.artint.2022.103819
>
dc:
title
Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
314
(xsd:string)