About: Hungarian algorithm

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

About: Hungarian algorithm Goto Sponge NotDistinct Permalink

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

The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods. It was developed and published in 1955 by Harold Kuhn, who gave the name "Hungarian method" because the algorithm was largely based on the earlier works of two Hungarian mathematicians: Dénes Kőnig and Jenő Egerváry.

Attributes	Values
rdf:type	Thing
rdfs:label	Hungarian algorithm (en)
rdfs:comment	The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods. It was developed and published in 1955 by Harold Kuhn, who gave the name "Hungarian method" because the algorithm was largely based on the earlier works of two Hungarian mathematicians: Dénes Kőnig and Jenő Egerváry. (en)
sameAs	Hungarian algorithm Hungarian algorithm
dbp:wikiPageUsesTemplate	dbt:Authority_control dbt:Citation_needed dbt:How dbt:ISBN dbt:Main dbt:Math dbt:Mvar dbt:Reflist dbt:Short_description dbt:Use_dmy_dates dbt:Confusing dbt:Aligned_table
Subject	Combinatorial optimization Matching (graph theory)
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Hungarian_algorithm?oldid=1069959706&ns=0
Wikipage page ID	2609001 (xsd:integer)
page length (characters) of wiki page	25169 (xsd:nonNegativeInteger)
Wikipage revision ID	1069959706 (xsd:integer)
Link from a Wikipage to another Wikipage	Ford–Fulkerson algorithm Algorithm András Frank Assignment problem Berge's theorem University of Western Ontario Breadth-first search Carl Gustav Jacob Jacobi Combinatorial optimization Glossary of graph theory Jack Edmonds James B. Orlin James Munkres Matching (graph theory) Duality (optimization) Jenő Egerváry Murray State University D. R. Fulkerson Hong Kong University of Science and Technology Hungary Time complexity Combinatorial optimization Complete bipartite graph Algorithmic complexity Dénes Kőnig Perfect matching Permutation matrix Harold W. Kuhn L. R. Ford Jr. Mike Dawes Matrix (mathematics) Ravindra K. Ahuja Richard M. Karp Thomas L. Magnanti dbr:R._A._Pilgrim
has abstract	The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods. It was developed and published in 1955 by Harold Kuhn, who gave the name "Hungarian method" because the algorithm was largely based on the earlier works of two Hungarian mathematicians: Dénes Kőnig and Jenő Egerváry. James Munkres reviewed the algorithm in 1957 and observed that it is (strongly) polynomial. Since then the algorithm has been known also as the Kuhn–Munkres algorithm or Munkres assignment algorithm. The time complexity of the original algorithm was , however Edmonds and Karp, and independently Tomizawa noticed that it can be modified to achieve an running time. One of the most popular variants is the Jonker–Volgenant algorithm. Ford and Fulkerson extended the method to general maximum flow problems in form of the Ford–Fulkerson algorithm. In 2006, it was discovered that Carl Gustav Jacobi had solved the assignment problem in the 19th century, and the solution had been published posthumously in 1890 in Latin. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Hungarian_algorithm
is differentFrom of	Topological sorting
is Wikipage redirect of	Hungarian method Munkres' assignment algorithm KM algorithm Kuhn's algorithm Kuhn-Munkres algorithm
is Link from a Wikipage to another Wikipage of	List of terms relating to algorithms and data structures Assignment problem Auction algorithm James Munkres Jenő Egerváry Hopcroft–Karp algorithm Hungarian Earth mover's distance List of algorithms Graph theory Index of combinatorics articles Harold W. Kuhn Matching (graph theory) Hungarian method Munkres' assignment algorithm KM algorithm Kuhn's algorithm Kuhn-Munkres algorithm
is known for of	Harold W. Kuhn
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Hungarian_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 (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software