The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
An efficient implementation of Edmonds'' maximum matching algorithm.
An efficient implementation of Edmonds'' maximum matching algorithm.
Implementation of algorithms for maximum matching on nonbipartite graphs.
Implementation of algorithms for maximum matching on nonbipartite graphs.
Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Combinational logic synthesis for LUT based field programmable gate arrays
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Band Ordering in Lossless Compression of Multispectral Images
IEEE Transactions on Computers
Greeding matching algorithms, an experimental study
Journal of Experimental Algorithmics (JEA)
Some Matching Problems for Bipartite Graphs
Journal of the ACM (JACM)
Combined bus and driver scheduling
Computers and Operations Research
Analyzing the Multiple-target-multiple-agent Scenario Using Optimal Assignment Algorithms
Journal of Intelligent and Robotic Systems
DAG-Map: Graph-Based FPGA Technology Mapping for Delay Optimization
IEEE Design & Test
Heuristics for weighted perfect matching
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A linear-time algorithm for a special case of disjoint set union
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Attribute value reordering for efficient hybrid OLAP
DOLAP '03 Proceedings of the 6th ACM international workshop on Data warehousing and OLAP
RNA secondary structure prediction with simple pseudoknots
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
Design automation for mask programmable fabrics
Proceedings of the 41st annual Design Automation Conference
Minimal length test vectors for multiple-fault detection
Theoretical Computer Science - Mathematical foundations of programming semantics
Adaptive Teamwork Coordination Using Graph Matching over Hierarchical Intentional Structures
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms (TALG)
An efficient group key establishment in location-aided mobile ad hoc networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
A novel CLB architecture and circuit packing algorithm for logic-area reduction in SRAM-based FPGAs
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
A near-optimal real-time hardware scheduler for large cardinality crossbar switches
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Incremental assignment problem
Information Sciences: an International Journal
Computing large matchings fast
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Novel pin assignment algorithms for components with very high pin counts
Proceedings of the conference on Design, automation and test in Europe
A two-stage hardware scheduler combining greedy and optimal scheduling
Journal of Parallel and Distributed Computing
The labeled maximum matching problem
Computers and Operations Research
Energy-aware register file re-partitioning for clustered VLIW architectures
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Maximum weighted matching using the partitioned global address space model
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Entry Pairing in Inverted File
WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
F-factors of graphs: A generalized matching problem
Information Processing Letters
Algorithms for the Bin Packing Problem with Conflicts
INFORMS Journal on Computing
Distributed tracking in a large-scale network of smart cameras
Proceedings of the Fourth ACM/IEEE International Conference on Distributed Smart Cameras
Computing large matchings fast
ACM Transactions on Algorithms (TALG)
Enhancing downlink performance in wireless networks by simultaneous multiple packet transmission
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Tolerating correlated failures for generalized Cartesian distributions via bipartite matching
Proceedings of the 8th ACM International Conference on Computing Frontiers
Sequence automata for researching consensus levels
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Complexity and approximation for scheduling problem for a torpedo
Computers and Industrial Engineering
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
RNA multiple structural alignment with longest common subsequences
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Partitioning planar graphs: a fast combinatorial approach for max-cut
Computational Optimization and Applications
Packet scheduling with joint design of MIMO and network coding
Journal of Parallel and Distributed Computing
Attribute value reordering for efficient hybrid OLAP
Information Sciences: an International Journal
Popular matchings in the marriage and roommates problems
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Hybrid optimization techniques for the workshift and rest assignment of nursing personnel
Artificial Intelligence in Medicine
Approximation algorithms for maximum dispersion
Operations Research Letters
Computing maximum non-crossing matching in convex bipartite graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Scheduling file transfers for data-intensive jobs on heterogeneous clusters
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Sequence automata for researching consensus levels
Transactions on Computational Collective Intelligence VIII
| Hi-index | 0.01 |
A matching on a graph is a set of edges, no two of which share a vertex. A maximum matching contains the greatest number of edges possible. This paper presents an efficient implementation of Edmonds' algorithm for finding a maximum matching. The computation time is proportional to V3, where V is the number of vertices; previous implementations of Edmonds' algorithm have computation time proportional to V4. The implementation is based on a system of labels that encodes the structure of alternating paths.