Computing finest mincut partitions of a graph and application to routing problems.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/dam/ReineltTW08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/dam/ReineltTW08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Dirk_Oliver_Theis
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Gerhard_Reinelt
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Klaus_Michael_Wenger
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.dam.2007.03.022
>
foaf:
homepage
<
https://doi.org/10.1016/j.dam.2007.03.022
>
dc:
identifier
DBLP journals/dam/ReineltTW08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.dam.2007.03.022
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/dam
>
rdfs:
label
Computing finest mincut partitions of a graph and application to routing problems.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Dirk_Oliver_Theis
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Gerhard_Reinelt
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Klaus_Michael_Wenger
>
swrc:
number
3
(xsd:string)
swrc:
pages
385-396
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/dam/ReineltTW08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/dam/ReineltTW08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/dam/dam156.html#ReineltTW08
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.dam.2007.03.022
>
dc:
title
Computing finest mincut partitions of a graph and application to routing problems.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
156
(xsd:string)