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

Cited in

(61)

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

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)