<http://experiment.worldcat.org/entity/work/data/21471195.nt> <http://rdfs.org/ns/void#inDataset> <http://purl.oclc.org/dataset/WorldCat/Works> .
<http://experiment.worldcat.org/entity/work/data/21471195.nt> <http://schema.org/about> <http://worldcat.org/entity/work/id/21471195> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85003487> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/workExample> <http://www.worldcat.org/oclc/780132296> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/workExample> <http://www.worldcat.org/oclc/19471900> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/about> <http://id.worldcat.org/fast/868961> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/name> "An O(nm log n) algorithm for maximum network flow"@en .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/name> "An O(nm log n) algorithm for maximum network flow" .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/name> "An O(nmlogn) algorithm for maximum network flow"@en .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/workExample> <http://www.worldcat.org/oclc/42710752> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/about> <http://id.worldcat.org/fast/946584> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/workExample> <http://www.worldcat.org/oclc/7815061> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/about> <http://id.worldcat.org/fast/805020> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/creator> <http://worldcat.org/entity/person/id/2745260868> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/contributor> <http://worldcat.org/entity/person/id/2632506503> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/workExample> <http://www.worldcat.org/oclc/257894455> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/workExample> <http://www.worldcat.org/oclc/897741155> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/name> "An O(n m log n) Algorithm for Maximum Network Flow" .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/creator> <http://worldcat.org/entity/person/id/2632506503> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85056471> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/about> <http://id.worldcat.org/fast/887978> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85035862> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/name> "An o(nmlogn) algorithm for maximum network flow" .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/about> <http://id.worldcat.org/fast/1036221> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/name> "An o(nm log n) algorithm for maximum network flow" .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/workExample> <http://www.worldcat.org/oclc/475986093> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/workExample> <http://www.worldcat.org/oclc/639700550> .
<http://worldcat.org/entity/work/id/21471195> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.productontology.org/id/Thesis> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85091074> .
<http://worldcat.org/entity/work/id/21471195> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85028802> .
<http://worldcat.org/entity/work/id/21471195> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://schema.org/Book> .
<http://worldcat.org/entity/work/id/21471195> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://schema.org/CreativeWork> .