Unifying Maximum Cut and Minimum Cut of a Planar Graph.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tc/ShihWK90
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tc/ShihWK90
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sun_Wu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Wei-Kuan_Shih
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yue-Sun_Kuo
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2F12.53581
>
foaf:
homepage
<
https://doi.org/10.1109/12.53581
>
dc:
identifier
DBLP journals/tc/ShihWK90
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2F12.53581
(xsd:string)
dcterms:
issued
1990
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tc
>
rdfs:
label
Unifying Maximum Cut and Minimum Cut of a Planar Graph.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sun_Wu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Wei-Kuan_Shih
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yue-Sun_Kuo
>
swrc:
number
5
(xsd:string)
swrc:
pages
694-697
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tc/ShihWK90/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tc/ShihWK90
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tc/tc39.html#ShihWK90
>
rdfs:
seeAlso
<
https://doi.org/10.1109/12.53581
>
dc:
subject
maximum cut; minimum cut; planar graph; nonnegative edge weights; computational complexity; graph theory.
(xsd:string)
dc:
title
Unifying Maximum Cut and Minimum Cut of a Planar Graph.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
39
(xsd:string)