A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/afp/Lochbihler16>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Andreas_Lochbihler>
foaf:homepage	<https://www.isa-afp.org/entries/MFMC_Countable.shtml>
dc:identifier	DBLP journals/afp/Lochbihler16 (xsd:string)
dcterms:issued	2016 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/afp>
rdfs:label	A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Andreas_Lochbihler>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/afp/Lochbihler16/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/afp/Lochbihler16>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/afp/afp2016.html#Lochbihler16>
rdfs:seeAlso	<https://www.isa-afp.org/entries/MFMC_Countable.shtml>
dc:title	A Formal Proof of 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	2016 (xsd:string)