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

Cited in

(61)

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

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)