J.E. Hopcroft and R.M. Karp. A n 5=2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2:225--231, 1973. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
On The Maximum Scatter Tsp - To Appear In (Correct)
No context found.
J.E. Hopcroft and R.M. Karp. A n 5=2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2:225--231, 1973.
DOI: 10.1007/s00453-004-1124-z - Algorithmica Of Of (Correct)
No context found.
J.E. Hopcroft and R.M. Karp. An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2:225--231, 1973.
A Vector Space Model for Semantic Similarity - Calculation And Owl (Correct)
No context found.
J. E. Hopcroft and R.M. Karp. An O(n 5/2 ) algorithm for maximum matching in bipartite graphs. SIAM J. Comput., 4:225--231, 1973.
Algorithms for Clustering High Dimensional and - Tao (Correct)
No context found.
J. Hopcroft and R. Karp. An n 5=2 algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing, 2(4):225--231, 1973.
Pareto Optimality in House Allocation Problems - David Abraham Katar (Correct)
No context found.
J.E. Hopcroft and R.M. Karp. A n 5=2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing, 2:225-231, 1973.
The alldifferent Constraint: A Survey - van Hoeve (2001) (3 citations) (Correct)
No context found.
J.E. Hopcroft and R.M. Karp. An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225--231, 1973.
On the Complexity of Several Haplotyping Problems - Cilibrasi, van Iersel, Kelk.. (Correct)
No context found.
J.E. Hopcroft, R.M. Karp, An n 5=2 algorithm for maximum matching in bipartite graphs, SIAM Journal on Computing 2, 225-231 (1973)
A Criterion for Monotone Circuit Complexity - Jukna (1991) (Correct)
No context found.
J. E. Hopcroft and R.M. Karp, An n 5=2 algorithm for maximum matching in bipartite graphs, SIAM J. Comput., 4 (1973), pp. 225-231
Packing Paths in Digraphs - Brewster, Hell, Pantel, Rizzi, Yeo (Correct)
No context found.
J. E. Hopcroft and R. M. Karp. An n 5=2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, 2(1973), 255-231.
Multiconsistency and Robustness with Global Constraints - Elbassioni, Katriel (Correct)
No context found.
J.E. Hopcroft and R.M. Karp. An n 5=2 algorithm for maximum matching in bipartite graphs. SIAM J. Computing, 2(4):225-231, 1973.
Location Privacy In Ubiquitous Computing - Beresford (2005) (2 citations) (Correct)
No context found.
John E. Hopcroft and Richard M. Karp. An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing, 2(4):225--231, December 1973. (Ref: p. 74.)
Indexing and Mining Free Trees - Chi, Yang, Muntz (2003) (4 citations) (Correct)
No context found.
J. E. Hopcroft and R. M. Karp. A n 5/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, 2:225--231, 1973.
A Debugging Scheme for Declarative Equation Based Modeling.. - Bunus, Fritzson (2002) (Correct)
No context found.
Hopcroft, J.E. and Karp, R.M. An n 2 algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing, 2(4):225--231, December 1973.
Semi-Matchings for Bipartite Graphs and Load Balancing - Harvey, Ladner, Lovasz, Tamir (2003) (2 citations) (Correct)
No context found.
J. Hopcroft and R. Karp. An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Computing, 2:225--231, 1973.
Matchings Meeting Quotas and their Impact on the Blow-Up Lemma - Rödl, Rucinski, Wagner (2001) (Correct)
No context found.
J. E. Hopcroft and R. M. Karp, An n 5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput., 2 (1973), pp. 225--231.
List Edge Multicoloring in Bounded Cyclicity Graphs - Marx (2003) (Correct)
No context found.
J. E. Hopcroft and R. M. Karp. An n 5=2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2:225-231, 1973.
Computing Shortest Violation Traces in Model Checking - Based On Petri (Correct)
No context found.
J. E. Hopcroft and R. M. Karp: An n Algorithm for Maximum Matching in Bipartite Graphs. SIAM Journal on Computing 2(4) (1973) 225--231.
Approximate Constrained Bipartite Edge Coloring - Caragiannis, Ferreira.. (2003) (Correct)
No context found.
J. Hopcroft and R. Karp. An n 5=2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing, 2 (1973), pp. 225--231.
An Integrative Proximity Measure for Ontology Alignment - Euzenat, Valtchev (2003) (3 citations) (Correct)
No context found.
John Hopcroft and Robert Karp. An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225--231, 1973.
Distributed Scheduling for Disconnected Cooperation - Malewicz (2003) (1 citation) (Correct)
No context found.
Hopcroft, J.E., Karp., R.M.: A O(n 5/ 2 ) algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, Vol. 2(4) (1973) 225--231
Optimal Scheduling for Disconnected Cooperation - Malewicz, Russell, Shvartsman (2001) (3 citations) (Correct)
No context found.
J.E. Hopcroft, R.M. Karp. A O(n 5/2 ) algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, Vol. 2, 225--231, 1973.
Combinatorial Analysis of Generic Matrix Pencils - Iwata, Shimizu (2004) (Correct)
No context found.
J. E. Hopcroft and R. M. Karp, An n 5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput., 2 (1973), 225--231.
A Simpler Linear Time 2/3 − ε Approximation for .. - Pettie, Sanders (Correct)
No context found.
John E. Hopcroft and Richard M. Karp. An n 5=2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2:225-231, 1973.
Maximum Skew-Symmetric Flows and Matchings - Goldberg, Karzanov (Correct)
No context found.
J. E. Hopcroft and R. M. Karp. An n algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 2 (1973) 225-231.
Linear Time Local Improvements for - Weighted Matchings In (Correct)
No context found.
J.E. Hopcroft, R.M. Karp, An n 5=2 algorithm for maximum matchings in bipartite graphs, SIAM Journal on Computing 2 (1973), 225-231
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC