Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

Hungarian algorithm

The Hungarian algorithm or 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 it the name "Hungarian method" because the algorithm was largely based on the earlier works of two…

Applications, Overview & The problem

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Hungarian algorithm. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

The problem

The algorithm in terms of bipartite graphs

The algorithm in O(n3) time

Connection to successive shortest paths

Matrix interpretation

Applications

Bibliography

Implementations

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Hungarian algorithm

Nodes49
Edges48
Triples97
Avg. degree1.96
Density0.040816
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Hungarian algorithm

Top relations

related to External links · 44
Hungarian algorithm → András Frank, Assignment, Assignment Problem, Bipartite Matching, Brilliant, Bruff, Budapest, Course, Course Notes, Department, Derek, Egervary Research Group, Extension, Fundamentals, Golin, H1117, Hong Kong University, Hungarian, Hungarian Method, Hungary
related to Bibliography · 27
Hungarian algorithm → Ahuja, Assignment Problems, Burkard, Central European Journal, Dell'Amico, Edizioni Libreria Progetto Padova, Fischetti, Hungarian, ISBN, Italia, Jeno Egerváry, Lezioni, Lock-gray-alt-2, Lock-green, Lock-red-alt-2, Magnanti, Martello, Network Flows, Operational Research, Orlin
related to Further reading · 12
Hungarian algorithm → Algorithms, Charles, Clifford, Cormen, Introduction, ISBN, Leiserson, Rivest, Ronald, Stein, The Hungarian, Thomas
has application · 7
Hungarian algorithm → Another, Extensions, For, Hungarian, In, Object, The Hungarian
related to Connection to successive shortest paths · 7
Hungarian algorithm → Fibonacci, JM, Johnson's, The, The Hungarian, W-1, When

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

displaystyle algorithm zero row assignment cost matching path edge edges problem one hungarian time matrix minimum tight potential workers find

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
Hungarian algorithmhas applicationThe Hungarian0.60section
Hungarian algorithmhas applicationFor0.60section
Hungarian algorithmhas applicationExtensions0.60section
Hungarian algorithmhas applicationAnother0.60section
Hungarian algorithmhas applicationObject0.60section
Hungarian algorithmhas applicationIn0.60section
Hungarian algorithmhas applicationHungarian0.60section
Hungarian algorithmrelated to BibliographyBurkard0.60section
Hungarian algorithmrelated to BibliographyDell'Amico0.60section
Hungarian algorithmrelated to BibliographyMartello0.60section
Hungarian algorithmrelated to BibliographyAssignment Problems0.60section
Hungarian algorithmrelated to BibliographyRevised0.60section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.