Back to Results
First PageMeta Content
Graph 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

Document Date: 2014-12-09 10:13:49


Open Document

File Size: 299,17 KB

Share Result on Facebook

Currency

pence / /

/

Facility

Stanford University / University of Pennsylvania / /

IndustryTerm

deterministic algorithms / balanced binary search tree / balanced search tree / deterministic algorithm / search tree / augmented binary search tree / balanced binary search trees / pre-processing time / bipartite matching algorithm / /

Organization

National Science Foundation / Department of Computer and Information Science / University of Pennsylvania / Stanford University / Institute for Computational and Mathematical Engineering / Philadelphia PA / /

/

ProvinceOrState

Pennsylvania / /

SportsLeague

Stanford University / /

Technology

randomized algorithm / 4 Algorithm / 7 Our algorithm / 1 The algorithm / time algorithm / sampling-based algorithm / deterministic algorithm / time algorithms / bipartite matching algorithm / same algorithm / Hopcroft-Karp algorithm / /

SocialTag