<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Soubor:Dinic_algorithm_Gf3.svg> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLinkText>	"Dinic\u016Fv algoritmus"@cs .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Goldberg\u016Fv_algoritmus> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/abstract>	"Dinic\u016Fv algoritmus (1970) je algoritmus vyvinut\u00FD Jefim Dinicem pro v\u00FDpo\u010Det maxim\u00E1ln\u00EDho toku v s\u00EDti. Hlavn\u00ED my\u0161lenka algoritmu spo\u010D\u00EDv\u00E1 v iterativn\u00EDm v\u00FDpo\u010Dtu tzv. \"blokuj\u00EDc\u00EDch\" tok\u016F, kter\u00E9 se postupn\u011B nas\u010D\u00EDtaj\u00ED a\u017E na tok maxim\u00E1ln\u00ED. Tento p\u0159\u00EDstup dovoluje v pr\u016Fm\u011Brn\u00E9m p\u0159\u00EDpad\u011B po\u010D\u00EDtat maxim\u00E1ln\u00ED tok rychleji ne\u017E Ford\u2013Fulkersonov\u00FDm algoritmem, kter\u00FD pro v\u00FDpo\u010Det vyu\u017E\u00EDv\u00E1 hled\u00E1n\u00ED zlep\u0161uj\u00EDc\u00EDch cest."@cs .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Soubor:Dinic_algorithm_GL2.svg> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Tok_v_s\u00EDti> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageOutDegree>	"19"^^<http://www.w3.org/2001/XMLSchema#nonNegativeInteger> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Soubor:Dinic_algorithm_GL3.svg> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Graf_(teorie_graf\u016F)> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Soubor:Dinic_algorithm_Gf1.svg> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Soubor:Dinic_algorithm_Gf2.svg> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Soubor:Dinic_algorithm_G1.svg> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Soubor:Dinic_algorithm_G2.svg> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://kam.mff.cuni.cz/~kuba/ka/> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Soubor:Dinic_algorithm_G3.svg> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Hrana_(graf)> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Soubor:Dinic_algorithm_GL1.svg> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageLength>	"5180"^^<http://www.w3.org/2001/XMLSchema#nonNegativeInteger> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://www.w3.org/2000/01/rdf-schema#label>	"Dinic\u016Fv algoritmus"@cs .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Maxim\u00E1ln\u00ED_tok> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Dinic\u016Fv algoritmus (1970) je algoritmus vyvinut\u00FD Jefim Dinicem pro v\u00FDpo\u010Det maxim\u00E1ln\u00EDho toku v s\u00EDti. Hlavn\u00ED my\u0161lenka algoritmu spo\u010D\u00EDv\u00E1 v iterativn\u00EDm v\u00FDpo\u010Dtu tzv. \"blokuj\u00EDc\u00EDch\" tok\u016F, kter\u00E9 se postupn\u011B nas\u010D\u00EDtaj\u00ED a\u017E na tok maxim\u00E1ln\u00ED. Tento p\u0159\u00EDstup dovoluje v pr\u016Fm\u011Brn\u00E9m p\u0159\u00EDpad\u011B po\u010D\u00EDtat maxim\u00E1ln\u00ED tok rychleji ne\u017E Ford\u2013Fulkersonov\u00FDm algoritmem, kter\u00FD pro v\u00FDpo\u010Det vyu\u017E\u00EDv\u00E1 hled\u00E1n\u00ED zlep\u0161uj\u00EDc\u00EDch cest."@cs .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://xmlns.com/foaf/0.1/depiction>	<http://commons.wikimedia.org/wiki/Special:FilePath/Dinic_algorithm_G1.svg> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_algoritmus> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Ford\u016Fv-Fulkerson\u016Fv_algoritmus> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageID>	"33852"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/thumbnail>	<http://commons.wikimedia.org/wiki/Special:FilePath/Dinic_algorithm_G1.svg?width=300> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Asymptotick\u00E1_\u010Dasov\u00E1_slo\u017Eitost> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageRevisionID>	"16532019"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://www.w3.org/ns/prov#wasDerivedFrom>	<http://cs.wikipedia.org/wiki/Dinic\u016Fv_algoritmus?oldid=16532019> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Kategorie:Toky_v_s\u00EDt\u00EDch> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/S\u00ED\u0165_(teorie_graf\u016F)> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://purl.org/dc/terms/subject>	<http://cs.dbpedia.org/resource/Kategorie:Toky_v_s\u00EDt\u00EDch> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://xmlns.com/foaf/0.1/isPrimaryTopicOf>	<http://cs.wikipedia.org/wiki/Dinic\u016Fv_algoritmus> .
<http://cs.dbpedia.org/resource/Dinic\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<https://knihy.nic.cz/files/edice/pruvodce_labyrintem_algoritmu.pdf> .