[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/KamidoiWY02>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Noriyoshi_Yoshida>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Shin%27ichi_Wakabayashi>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Yoko_Kamidoi>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs00453-001-0070-2>
foaf:homepage <https://doi.org/10.1007/s00453-001-0070-2>
dc:identifier DBLP journals/algorithmica/KamidoiWY02 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs00453-001-0070-2 (xsd:string)
dcterms:issued 2002 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/algorithmica>
rdfs:label A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Noriyoshi_Yoshida>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Shin%27ichi_Wakabayashi>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Yoko_Kamidoi>
swrc:number 2 (xsd:string)
swrc:pages 262-276 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/KamidoiWY02/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/algorithmica/KamidoiWY02>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica32.html#KamidoiWY02>
rdfs:seeAlso <https://doi.org/10.1007/s00453-001-0070-2>
dc:subject Deterministic algorithm, Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Recursive structure. (xsd:string)
dc:title A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 32 (xsd:string)