A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/itp/Lochbihler21
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/itp/Lochbihler21
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Andreas_Lochbihler
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.4230%2FLIPIcs.ITP.2021.25
>
foaf:
homepage
<
https://doi.org/10.4230/LIPIcs.ITP.2021.25
>
dc:
identifier
DBLP conf/itp/Lochbihler21
(xsd:string)
dc:
identifier
DOI doi.org%2F10.4230%2FLIPIcs.ITP.2021.25
(xsd:string)
dcterms:
issued
2021
(xsd:gYear)
rdfs:
label
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Andreas_Lochbihler
>
swrc:
pages
25:1-25:18
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/itp/2021
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/itp/Lochbihler21/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/itp/Lochbihler21
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/itp/itp2021.html#Lochbihler21
>
rdfs:
seeAlso
<
https://doi.org/10.4230/LIPIcs.ITP.2021.25
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/itp
>
dc:
title
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document