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
Approximate GCD in a Bernstein basis
We adapt Victor Y. Pan's root-based algorithm for finding approximate GCD to the case where the polynomials are expressed in… 
2018
2018
Scheduling in the Hybrid Cloud Constrained by Process Mining
Task scheduling in hybrid clouds has been widely used to achieve scalability and security goals for cloud computing. If not well… 
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
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… 
2016
2016
Reducing Access Latency in Virtual Machine Assignments
In cloud systems, big data must be partitioned and then stored over several data nodes (DNs) for being processed by virtual… 
2014
2014
Penentuan Matching Maksimum pada Graph Tidak Berbobot Menggunakan Algoritma Hopcroft-Karp
Review
2013
Review
2013
Fast Houseswapping Segmentation
Housing markets typify the general problem of reallocating indivisible goods amongst a group of agents according to their… 
2013
2013
Heuristic for maximum matching in directed complex networks
Determining maximum matching in any network has always been a problem of immense concern. Its solution is a necessary requirement… 
2012
2012
A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs
An (f;g)-semi-matching in a bipartite graph G = (U(V;E) is a set of edges M E such that each vertex u2 U is incident with at most… 
2004
2004
Practical Algorithmic Optimizations for Finding Maximal Matchings in Induced Subgraphs of Grids and Minimum Cost Perfect Matchings in Bipartite Graphs
In this paper we present practical algorithmic optimizations addressing two problems. The first one is concerned with computing a… 
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)