Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/qip/HamiltonH17
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/qip/HamiltonH17
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Kathleen_E._Hamilton
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Travis_S._Humble
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs11128-016-1513-7
>
foaf:
homepage
<
https://doi.org/10.1007/s11128-016-1513-7
>
dc:
identifier
DBLP journals/qip/HamiltonH17
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs11128-016-1513-7
(xsd:string)
dcterms:
issued
2017
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/qip
>
rdfs:
label
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Kathleen_E._Hamilton
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Travis_S._Humble
>
swrc:
number
4
(xsd:string)
swrc:
pages
94
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/qip/HamiltonH17/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/qip/HamiltonH17
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/qip/qip16.html#HamiltonH17
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s11128-016-1513-7
>
dc:
title
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
16
(xsd:string)