<http://experiment.worldcat.org/entity/work/data/42228821.nt> <http://rdfs.org/ns/void#inDataset> <http://purl.oclc.org/dataset/WorldCat/Works> .
<http://experiment.worldcat.org/entity/work/data/42228821.nt> <http://schema.org/about> <http://worldcat.org/entity/work/id/42228821> .
<http://worldcat.org/entity/work/id/42228821> <http://schema.org/creator> <http://worldcat.org/entity/person/id/2632506503> .
<http://worldcat.org/entity/work/id/42228821> <http://schema.org/workExample> <http://www.worldcat.org/oclc/38635147> .
<http://worldcat.org/entity/work/id/42228821> <http://schema.org/name> "An 0 (nm log n) algorithm for maximum network flow"@en .
<http://worldcat.org/entity/work/id/42228821> <http://schema.org/about> <http://id.worldcat.org/fast/805020> .
<http://worldcat.org/entity/work/id/42228821> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85028802> .
<http://worldcat.org/entity/work/id/42228821> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85091074> .
<http://worldcat.org/entity/work/id/42228821> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.productontology.org/id/Thesis> .
<http://worldcat.org/entity/work/id/42228821> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://schema.org/CreativeWork> .
<http://worldcat.org/entity/work/id/42228821> <http://schema.org/alternateName> "Maximum network flow"@en .
<http://worldcat.org/entity/work/id/42228821> <http://schema.org/about> <http://id.worldcat.org/fast/1036221> .
<http://worldcat.org/entity/work/id/42228821> <http://schema.org/about> <http://id.worldcat.org/fast/868961> .
<http://worldcat.org/entity/work/id/42228821> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85003487> .