An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Cited in

(64)

The labeled maximum matching problem
Stacks in canonical RNA pseudoknot structures
A linear-time algorithm for a special case of disjoint set union
An augmenting path algorithm for linear matroid parity
The general maximum matching algorithm of Micali and Vazirani
A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
F-factors of graphs: A generalized matching problem
On generalized matching problems
Algorithmic proofs of two relations between connectivity and the 1- factors of a graph
Matching theory -- a sampler: From Dénes König to the present
Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs
Searching for a strong double tracing in a graph
A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
Approximation algorithms for maximum dispersion
Constraint programming approach for school timetabling.
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
Approximate minimum weight matching on points in k-dimensional space
Minimal length test vectors for multiple-fault detection
Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers
Two dimensional maximum weight matching using Manhattan topology
Improved approximations for capacitated vehicle routing with unsplittable client demands
Reinforcement learning for optimal error correction of toric codes
Computing maximum non-crossing matching in convex bipartite graphs
A complexity and approximation framework for the maximization scaffolding problem
A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
Approximation algorithms for hard capacitated \(k\)-facility location problems
Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
Gallai-Edmonds decomposition as a pruning technique
Dynamic matchings and quasidynamic fractional matchings. I
Sparsest-cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
Worst-case greedy matchings in the unitd-cube
Complexity results for storage loading problems with stacking constraints
Improved approximation algorithms for weighted 2-path partitions
Strict matching matroids and matroid algorithms
Optimum matching forests I: Special weights
Scheduling jobs to two machines subject to batch arrival ordering
Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching
On vertex independence number of uniform hypergraphs
Maximum matching of given weight in complete and complete bipartite graphs
Partitioning planar graphs: a fast combinatorial approach for max-cut
A two-stage hardware scheduler combining greedy and optimal scheduling
Deep Haar scattering networks
On the matching number of an uncertain graph
Trustworthy Graph Algorithms (Invited Talk)
Greedy matching: guarantees and limitations
On the anti-Kekulé problem of cubic graphs
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
A scaling algorithm for maximum weight matching in bipartite graphs
Algorithms for weighted matching generalizations. II: f-factors and the special case of shortest paths
A randomized approximation algorithm for metric triangle packing
Combined bus and driver scheduling
A weight-scaling algorithm for \(f\)-factors of multigraphs
On the parallel complexity of constrained read-once refutations in UTVPI constraint systems
New approximation results on graph matching and related problems
Computational complexity of \(k\)-stable matchings
Constrained read-once refutations in UTVPI constraint systems: a parallel perspective
1-Approximation algorithm for bottleneck disjoint path matching
A formal correctness proof of Edmonds' blossom shrinking algorithm
A new class of lower bounds for scheduling a batch processing machine to minimize makespan
Maximum flow and minimum-cost flow in almost-linear time
Attribute value reordering for efficient hybrid OLAP
Incremental assignment problem
A quantization framework for smoothed analysis of Euclidean optimization problems
An efficient distributed algorithm for maximum matching in general graphs

This page was built for publication: An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4091992)