Statements (75)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:Artificial_Intelligence
|
| gptkbp:applies_to |
graph theory
|
| gptkbp:can_be_extended_by |
general graphs
|
| gptkbp:can_be_used_in |
job assignment problems
|
| gptkbp:designed_for |
finding maximum cardinality matchings in bipartite graphs
|
| gptkbp:developed_by |
gptkb:John_Hopcroft
|
| gptkbp:example |
combinatorial optimization
a polynomial-time algorithm. |
| gptkbp:has_applications_in |
scheduling problems
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hopcroft's algorithm
|
| gptkbp:improves |
naive matching algorithms
|
| gptkbp:input_output |
bipartite graph
maximum matching |
| gptkbp:introduced_in |
the paper ' An n√n algorithm for maximum matchings in bipartite graphs'.
|
| gptkbp:is_a |
deterministic algorithm.
greedy algorithm. |
| gptkbp:is_applied_in |
telecommunications.
resource allocation problems. |
| gptkbp:is_based_on |
augmenting paths
the concept of augmenting paths. |
| gptkbp:is_considered |
a benchmark for matching algorithms.
a classic algorithm. a foundational algorithm. a fundamental algorithm in computer science a key algorithm in theoretical computer science. a practical algorithm. a reliable algorithm. a standard algorithm. a versatile algorithm. efficient for sparse graphs. |
| gptkbp:is_effective_against |
large bipartite graphs
|
| gptkbp:is_implemented_in |
various programming languages
graph libraries. graph theory textbooks. software for network analysis. |
| gptkbp:is_optimized_for |
maximum matching in bipartite graphs
|
| gptkbp:is_part_of |
the study of algorithms.
algorithmic graph theory. graph matching theory the curriculum of algorithm courses. the foundation of modern algorithms. the study of combinatorial algorithms. the toolkit of computer scientists. |
| gptkbp:is_related_to |
gptkb:Hungarian_algorithm
the study of computational complexity. bipartite matching. the field of operations research. the study of matching theory. the theory of NP-completeness. |
| gptkbp:is_taught_in |
computer science courses
|
| gptkbp:is_used_by |
researchers in combinatorial optimization.
|
| gptkbp:is_used_in |
bioinformatics.
machine learning. network design. optimization problems. resource management. database query optimization data mining. software engineering. computer vision. algorithm analysis. algorithm competitions. graph-based applications. social network analysis. |
| gptkbp:is_used_to |
solve matching problems.
|
| gptkbp:published_in |
gptkb:1973
|
| gptkbp:related_to |
Kuhn-Munkres algorithm
|
| gptkbp:requires |
adjacency list representation
|
| gptkbp:space_complexity |
O(V)
|
| gptkbp:speed |
previous algorithms for the same problem.
|
| gptkbp:suitable_for |
real-time applications.
|
| gptkbp:time_complexity |
O(E√ V)
|
| gptkbp:used_in |
network flow problems
|
| gptkbp:bfsParent |
gptkb:John_E._Hopcroft
|
| gptkbp:bfsLayer |
5
|