A strongly polynomial algorithm for the minimum maximum flow degree problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/orl/CampeloM23
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/orl/CampeloM23
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jhonata_A._S._Matias
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Manoel_B._Camp%E2%88%9A%E2%84%A2lo
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.orl.2022.12.004
>
foaf:
homepage
<
https://doi.org/10.1016/j.orl.2022.12.004
>
dc:
identifier
DBLP journals/orl/CampeloM23
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.orl.2022.12.004
(xsd:string)
dcterms:
issued
2023
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/orl
>
rdfs:
label
A strongly polynomial algorithm for the minimum maximum flow degree problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jhonata_A._S._Matias
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Manoel_B._Camp%E2%88%9A%E2%84%A2lo
>
swrc:
month
January
(xsd:string)
swrc:
number
1
(xsd:string)
swrc:
pages
67-71
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/orl/CampeloM23/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/orl/CampeloM23
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/orl/orl51.html#CampeloM23
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.orl.2022.12.004
>
dc:
title
A strongly polynomial algorithm for the minimum maximum flow degree problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
51
(xsd:string)