Processor efficient parallel matching
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Fast sparse matrix multiplication
ACM Transactions on Algorithms (TALG)
The complexity of matrix completion
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the complexity of approximating k-set packing
Computational Complexity
Maximum matching in graphs with an excluded minor
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An algebraic algorithm for weighted linear matroid intersection
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Note: On finding a large number of 3D points with a small diameter
Discrete Applied Mathematics
Computing large matchings fast
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
From Top Coders to Top IT Professionals
ISSEP '08 Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking
A Path Cover Technique for LCAs in Dags
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Journal of Discrete Algorithms
Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An algorithm for computing simple k-factors
Information Processing Letters
Maximum weight bipartite matching in matrix multiplication time
Theoretical Computer Science
Optimal layer assignment for escape routing of buses
Proceedings of the 2009 International Conference on Computer-Aided Design
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Perfect matchings via uniform sampling in regular bipartite graphs
ACM Transactions on Algorithms (TALG)
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Computing large matchings fast
ACM Transactions on Algorithms (TALG)
Improved approximation bounds for the minimum rainbow subgraph problem
Information Processing Letters
Zigzag persistent homology in matrix multiplication time
Proceedings of the twenty-seventh annual symposium on Computational geometry
Computing large matchings in planar graphs with fixed minimum degree
Theoretical Computer Science
Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Jump number of two-directional orthogonal ray graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Beyond triangulation: covering polygons with triangles
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Scheduling partially ordered jobs faster than 2n
ESA'11 Proceedings of the 19th European conference on Algorithms
Capacitated domination faster than O(2n)
Information Processing Letters
Design, implementation, and analysis of maximum transversal algorithms
ACM Transactions on Mathematical Software (TOMS)
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A scaling algorithm for maximum weight matching in bipartite graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Quantum algorithms for matching and network flows
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Algebraic algorithms for linear matroid parity problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Fast algorithms for weighted bipartite matching
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Capacitated domination faster than O(2n)
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Efficient algorithms for weighted rank-maximal matchings and related problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A search-engine concept based on multi-feature vectors and spatial relationship
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
On computing an optimal semi-matching
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Fast matrix rank algorithms and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Rigging tournament brackets for weaker players
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review
A more reliable greedy heuristic for maximum matchings in sparse random graphs
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
A simple reduction from maximum weight matching to maximum cardinality matching
Information Processing Letters
Discrete Applied Mathematics
Dynamic matchings in convex bipartite graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
A model for minimizing active processor time
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Using relations to develop a haskell program for computing maximum bipartite matchings
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
How to grow more pairs: suggesting review targets for comparison-friendly review ecosystems
Proceedings of the 22nd international conference on World Wide Web
Fast matrix rank algorithms and applications
Journal of the ACM (JACM)
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
| Hi-index | 0.01 |
We present randomized algorithms for finding maximum matchings in general and bipartite graphs. Both algorithms have running time O(n^\omega), where \omega is the exponent of the best known matrix multiplication algorithm. Since \omega