[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/jct/AharoniBGPS11>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Agelos_Georgakopoulos>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Amitai_Perlstein>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Eli_Berger>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Philipp_Spr%E2%88%9A%C4%BEssel>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Ron_Aharoni>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1016%2Fj.jctb.2010.08.002>
foaf:homepage <https://doi.org/10.1016/j.jctb.2010.08.002>
dc:identifier DBLP journals/jct/AharoniBGPS11 (xsd:string)
dc:identifier DOI doi.org%2F10.1016%2Fj.jctb.2010.08.002 (xsd:string)
dcterms:issued 2011 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/jct>
rdfs:label The Max-Flow Min-Cut theorem for countable networks. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Agelos_Georgakopoulos>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Amitai_Perlstein>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Eli_Berger>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Philipp_Spr%E2%88%9A%C4%BEssel>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Ron_Aharoni>
swrc:number 1 (xsd:string)
swrc:pages 1-17 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/jct/AharoniBGPS11/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/jct/AharoniBGPS11>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/jct/jctb101.html#AharoniBGPS11>
rdfs:seeAlso <https://doi.org/10.1016/j.jctb.2010.08.002>
dc:title The Max-Flow Min-Cut theorem for countable networks. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 101 (xsd:string)