<http://experiment.worldcat.org/entity/work/data/17724240#Topic/algorithmus> <http://schema.org/name> "Algorithmus." .
<http://experiment.worldcat.org/entity/work/data/17724240#Topic/algorithmus> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://schema.org/Topic> .
<http://experiment.worldcat.org/entity/work/data/17724240#Topic/polynom> <http://schema.org/name> "Polynom." .
<http://experiment.worldcat.org/entity/work/data/17724240#Topic/polynom> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://schema.org/Topic> .
<http://experiment.worldcat.org/entity/work/data/17724240.nt> <http://rdfs.org/ns/void#inDataset> <http://purl.oclc.org/dataset/WorldCat/Works> .
<http://experiment.worldcat.org/entity/work/data/17724240.nt> <http://schema.org/about> <http://worldcat.org/entity/work/id/17724240> .
<http://experiment.worldcat.org/entity/work/data/17724240#Topic/netzwerk> <http://schema.org/name> "Netzwerk." .
<http://experiment.worldcat.org/entity/work/data/17724240#Topic/netzwerk> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://schema.org/Topic> .
<http://experiment.worldcat.org/entity/work/data/17724240#Topic/approximation> <http://schema.org/name> "Approximation." .
<http://experiment.worldcat.org/entity/work/data/17724240#Topic/approximation> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://schema.org/Topic> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/workExample> <http://www.worldcat.org/oclc/18526863> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://id.worldcat.org/fast/1077890> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/contributor> <http://worldcat.org/entity/person/id/2667011297> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85107109> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/workExample> <http://www.worldcat.org/oclc/18484222> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://id.worldcat.org/fast/946584> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/workExample> <http://www.worldcat.org/oclc/897729740> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85003487> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://experiment.worldcat.org/entity/work/data/17724240#Topic/approximation> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://id.worldcat.org/fast/811829> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://id.worldcat.org/fast/1070715> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/contributor> <http://worldcat.org/entity/person/id/2634348854> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85006190> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/name> "Finding munimum-cost circulations by successive approximation" .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://experiment.worldcat.org/entity/work/data/17724240#Topic/algorithmus> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85104702> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://id.loc.gov/authorities/subjects/sh85056471> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/creator> <http://worldcat.org/entity/person/id/2628700751> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://experiment.worldcat.org/entity/work/data/17724240#Topic/polynom> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://id.worldcat.org/fast/805020> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/creator> <http://worldcat.org/entity/person/id/2672918563> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/about> <http://experiment.worldcat.org/entity/work/data/17724240#Topic/netzwerk> .
<http://worldcat.org/entity/work/id/17724240> <http://schema.org/name> "Finding minimum-cost circulations by successive approximation"@en .
<http://worldcat.org/entity/work/id/17724240> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://schema.org/CreativeWork> .