A novel formulation of the max-cut problem and related algorithm.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/amc/YangLH20
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/amc/YangLH20
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Pengfei_Huang
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Qingzhi_Yang
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yiyong_Li
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.amc.2019.124970
>
foaf:
homepage
<
https://doi.org/10.1016/j.amc.2019.124970
>
dc:
identifier
DBLP journals/amc/YangLH20
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.amc.2019.124970
(xsd:string)
dcterms:
issued
2020
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/amc
>
rdfs:
label
A novel formulation of the max-cut problem and related algorithm.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Pengfei_Huang
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Qingzhi_Yang
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yiyong_Li
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/amc/YangLH20/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/amc/YangLH20
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/amc/amc371.html#YangLH20
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.amc.2019.124970
>
dc:
title
A novel formulation of the max-cut problem and related algorithm.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
371
(xsd:string)