Skip to search formSkip to main contentSkip to account menu

Hopcroft–Karp algorithm

Known as: Hopcroft Karp, Hopcroft-Karp, Hopcroft-Karp algorithm 
The algorithm was found by John Hopcroft and Richard Karp (). As in previous methods for matching such as the Hungarian algorithm and the work of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

18 relations
3-dimensional matchingAlgorithmAlgorithmicaAssignment problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
DEQ: Equivalence Checker for Deterministic Register Automata
Register automata are one of the most studied automata models over infinite alphabets with applications in learning, systems… 
2018
2018
A near Pareto optimal approach to student-supervisor allocation with two sided preferences and workload balance
2017
2017
On sentence membership problem in context-sensitive languages
A new type of graph is introduced, the grammar graph. The possibility of assigning labels to each node in such a graph extends it… 
2016
2016
A Guide to Developing and Evaluating a College Readiness Screener. REL 2016-169.
Half of all undergraduates take one or more developmental education courses (sometimes called remedial courses), at an average… 
2016
2016
Minimal Separating Sequences for All Pairs of States
Finding minimal separating sequences for all pairs of inequivalent states in a finite state machine is a classic problem in… 
2016
2016
Common Connected Components of Interval Graphs
The Common Connected Problem (CCP) consists in identifying common connected components in two or more graphs on the same vertices… 
2009
2009
On the Hopcroft's minimization technique for DFA and DFCA
1999
1999
A Simpliied Realization of the Hopcroft-karp Approach to Maximum Matching in General Graphs
In 2, 3], we have reduced the problem of nding an augmenting path in a general graph to a reachability problem in a directed… 
1999
1999
A Simpliied Realization of the Hopcroft-karp Approach to Maximum Matching in Nonbipartite Graphs
In 2, 3], we have reduced the problem of nding an augmenting path in a nonbipartite graph to a reachability problem in a directed… 
Highly Cited
1982
Highly Cited
1982
Partitioning a Graph in O(|A| log2 |V|)
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)