Hopcroft–Karp algorithm

Results: 10



#Item
1Online Bipartite Perfect Matching With Augmentations Kamalika Chaudhuri∗ , Constantinos Daskalakis† , Robert D. Kleinberg‡ , and Henry Lin† ∗ Information  Theory and Applications Center, U.C. San Diego

Online Bipartite Perfect Matching With Augmentations Kamalika Chaudhuri∗ , Constantinos Daskalakis† , Robert D. Kleinberg‡ , and Henry Lin† ∗ Information Theory and Applications Center, U.C. San Diego

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2011-01-01 02:41:47
2Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs.

Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs.

Add to Reading List

Source URL: www.mmds.org

Language: English - Date: 2014-08-11 13:15:52
3Survey of appropriate matching algorithms for large scale systems of differential algebraic equations

Survey of appropriate matching algorithms for large scale systems of differential algebraic equations

Add to Reading List

Source URL: www.ep.liu.se

Language: English - Date: 2012-11-15 08:11:20
4Approximating matching size from random streams Michael Kapralov⇤ Sanjeev Khanna†  Madhu Sudan‡

Approximating matching size from random streams Michael Kapralov⇤ Sanjeev Khanna† Madhu Sudan‡

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-12-09 10:13:51
5Perfect Matchings in O(n log n) Time in Regular Bipartite Graphs Ashish Goel∗ Michael Kapralov†  Sanjeev Khanna‡

Perfect Matchings in O(n log n) Time in Regular Bipartite Graphs Ashish Goel∗ Michael Kapralov† Sanjeev Khanna‡

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-12-09 10:13:49
6Shortest Path Set Induced Vertex Ordering and its Application to Distributed Distance Optimal Formation Path Planning and Control on Graphs Jingjin Yu Steven M. LaValle

Shortest Path Set Induced Vertex Ordering and its Application to Distributed Distance Optimal Formation Path Planning and Control on Graphs Jingjin Yu Steven M. LaValle

Add to Reading List

Source URL: msl.cs.uiuc.edu

Language: English - Date: 2014-02-07 08:36:04
7Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Srini Devadas and Erik Demaine April 2, 2008 Handout 9

Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Srini Devadas and Erik Demaine April 2, 2008 Handout 9

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2008-04-10 14:03:04
8Ranking of Closeness Centrality for Large-Scale Social Networks Kazuya Okamoto1 , Wei Chen2 , and Xiang-Yang Li3 1  Kyoto University, [removed]

Ranking of Closeness Centrality for Large-Scale Social Networks Kazuya Okamoto1 , Wei Chen2 , and Xiang-Yang Li3 1 Kyoto University, [removed]

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2009-07-21 19:43:34
9On the uniform generation of random graphs with prescribed degree sequences R. Milo,1, 2 N. Kashtan,2, 3 S. Itzkovitz,1, 2 M. E. J. Newman,4 and U. Alon1, 2 Department of Physics of Complex Systems, Weizmann Institute of

On the uniform generation of random graphs with prescribed degree sequences R. Milo,1, 2 N. Kashtan,2, 3 S. Itzkovitz,1, 2 M. E. J. Newman,4 and U. Alon1, 2 Department of Physics of Complex Systems, Weizmann Institute of

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2012-09-27 02:30:03
10Efficient map-matching of large GPS data sets Tests on a speed monitoring experiment in Zurich F. Marchal∗

Efficient map-matching of large GPS data sets Tests on a speed monitoring experiment in Zurich F. Marchal∗

Add to Reading List

Source URL: www.strc.ch

Language: English - Date: 2008-12-12 12:18:14