About: Dinic's algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Dinic's algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim (Chaim) A. Dinitz. The algorithm runs in time and is similar to the Edmonds–Karp algorithm, which runs in time, in that it uses shortest augmenting paths. The introduction of the concepts of the level graph and blocking flow enable Dinic's algorithm to achieve its performance.

Attributes	Values
rdfs:label	Dinic's algorithm (en)
rdfs:comment	Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim (Chaim) A. Dinitz. The algorithm runs in time and is similar to the Edmonds–Karp algorithm, which runs in time, in that it uses shortest augmenting paths. The introduction of the concepts of the level graph and blocking flow enable Dinic's algorithm to achieve its performance. (en)
sameAs	Dinic's algorithm Dinic's algorithm
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Reflist dbt:Sfn dbt:Optimization_algorithms
Subject	Graph algorithms Network flow problem
thumbnail	wiki-commons:Special:FilePath/Dinic_algorithm_G1.svg?width=300
foaf:depiction
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Dinic's_algorithm?oldid=1054207717&ns=0
Wikipage page ID	23635821 (xsd:integer)
page length (characters) of wiki page	10808 (xsd:nonNegativeInteger)
Wikipage revision ID	1054207717 (xsd:integer)
Link from a Wikipage to another Wikipage	Flow network Ford–Fulkerson algorithm Alexander V. Karzanov Technion – Israel Institute of Technology Breadth-first search Georgy Adelson-Velsky Graph algorithms Network flow problem Hopcroft–Karp algorithm Link/cut tree Shimon Even Time complexity Edmonds–Karp algorithm Depth-first search Matching (graph theory) Maximum flow problem
has abstract	Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim (Chaim) A. Dinitz. The algorithm runs in time and is similar to the Edmonds–Karp algorithm, which runs in time, in that it uses shortest augmenting paths. The introduction of the concepts of the level graph and blocking flow enable Dinic's algorithm to achieve its performance. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Dinic's_algorithm
is Wikipage redirect of	Dinic's Algorithm Blocking flow Dinic algorithm Dinitz blocking flow algorithm
is Link from a Wikipage to another Wikipage of	Flow network Ford–Fulkerson algorithm List of terms relating to algorithms and data structures Dinic Dinic's Algorithm Dinitz Hopcroft–Karp algorithm Link/cut tree Edmonds–Karp algorithm List of algorithms Blocking flow Maximum flow problem Network flow problem Dinic algorithm Dinitz blocking flow algorithm
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Dinic's_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 2 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software