Hopcroft–Karp algorithm

Results: 10



#Item
1Analysis of algorithms / Combinatorial optimization / Matching / Randomized algorithm / Load balancing / Server / SL / Big O notation / Hopcroft–Karp algorithm / Theoretical computer science / Computational complexity theory / Mathematics

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
2Jeffrey Ullman / Anand Rajaraman / Computer science / Hopcroft–Karp algorithm / John Hopcroft / Mathematics / Matching / Theoretical computer science

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
3Matching / Combinatorial optimization / Hopcroft–Karp algorithm / Pantelides algorithm / Algorithm / Modelica / Maximum flow problem / Adjacency matrix / Differential algebraic equation / Mathematics / Theoretical computer science / Graph theory

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
4NP-complete problems / Matching / SL / Randomized algorithm / Hopcroft–Karp algorithm / Theoretical computer science / Computational complexity theory / Mathematics

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
5Graph coloring / Combinatorial optimization / Hopcroft–Karp algorithm / NP-complete problems / Edge coloring / Bipartite graph / Eulerian path / Connected component / Connectivity / Graph theory / Mathematics / Matching

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
6Routing algorithms / Network theory / Shortest path problem / Distance / Matching / Edge disjoint shortest pair algorithm / Hopcroft–Karp algorithm / Mathematics / Graph theory / Theoretical computer science

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
7Graph / Bellman–Ford algorithm / Shortest path problem / Degree / Directed acyclic graph / Distance / Tree / Connectivity / Hopcroft–Karp algorithm / Graph theory / Mathematics / Theoretical computer science

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
8Network theory / Centrality / Betweenness centrality / Distance / Connectivity / Connected component / Graph / Shortest path problem / Hopcroft–Karp algorithm / Graph theory / Mathematics / Theoretical computer science

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
9Probabilistic complexity theory / Algorithm / Mathematical logic / Random graph / Markov chain Monte Carlo / Monte Carlo method / Matching / Edge coloring / Hopcroft–Karp algorithm / Mathematics / Theoretical computer science / Applied mathematics

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
10GPS / Combinatorial optimization / Aerospace engineering / Missile guidance / Technology systems / Global Positioning System / GPS navigation device / Matching / Hopcroft–Karp algorithm / Technology / Military science / Mathematics

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
UPDATE