[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/corr/abs-2211-06267>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Davis_Issac>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Nadym_Mallek>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Nikhil_Kumar_0001>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Tobias_Friedrich_0001>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Ziena_Zeif>
foaf:homepage <http://dx.doi.org/doi.org%2F10.48550%2FarXiv.2211.06267>
foaf:homepage <https://doi.org/10.48550/arXiv.2211.06267>
dc:identifier DBLP journals/corr/abs-2211-06267 (xsd:string)
dc:identifier DOI doi.org%2F10.48550%2FarXiv.2211.06267 (xsd:string)
dcterms:issued 2022 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/corr>
rdfs:label Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Davis_Issac>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Nadym_Mallek>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Nikhil_Kumar_0001>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Tobias_Friedrich_0001>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Ziena_Zeif>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/corr/abs-2211-06267/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/corr/abs-2211-06267>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/corr/corr2211.html#abs-2211-06267>
rdfs:seeAlso <https://doi.org/10.48550/arXiv.2211.06267>
dc:title Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume abs/2211.06267 (xsd:string)