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

Cited In (62)

Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths
A weight-scaling algorithm for \(f\)-factors of multigraphs
New approximation results on graph matching and related problems
Constrained read-once refutations in UTVPI constraint systems: a parallel perspective
Scheduling jobs to two machines subject to batch arrival ordering
On the parallel complexity of constrained read-once refutations in UTVPI constraint systems
Computational complexity of \(k\)-stable matchings
Approximation algorithms for maximum dispersion
Reinforcement learning for optimal error correction of toric codes
An efficient distributed algorithm for maximum matching in general graphs
Title not available (Why is that?)
Worst-case greedy matchings in the unitd-cube
Searching for a strong double tracing in a graph
A randomized approximation algorithm for metric triangle packing
Attribute value reordering for efficient hybrid OLAP
On generalized matching problems
On the anti-Kekulé problem of cubic graphs
On vertex independence number of uniform hypergraphs
Approximate minimum weight matching on points in k-dimensional space
Partitioning planar graphs: a fast combinatorial approach for max-cut
A two-stage hardware scheduler combining greedy and optimal scheduling
A linear-time algorithm for a special case of disjoint set union
Incremental assignment problem
Strict matching matroids and matroid algorithms
The labeled maximum matching problem
A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
Gallai-Edmonds decomposition as a pruning technique
Dynamic matchings and quasidynamic fractional matchings. I
Optimum matching forests I: Special weights
Title not available (Why is that?)
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
A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers
Constraint programming approach for school timetabling.
Trustworthy Graph Algorithms (Invited Talk)
A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
Computing maximum non-crossing matching in convex bipartite graphs
The general maximum matching algorithm of Micali and Vazirani
Complexity results for storage loading problems with stacking constraints
A complexity and approximation framework for the maximization scaffolding problem
ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Two dimensional maximum weight matching using Manhattan topology
Stacks in canonical RNA pseudoknot structures
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
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem
A model for minimizing active processor time
Combined bus and driver scheduling
Deep Haar scattering networks
Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
Minimal length test vectors for multiple-fault detection
Greedy matching: guarantees and limitations
Maximum matching of given weight in complete and complete bipartite graphs
Improved approximations for capacitated vehicle routing with unsplittable client demands
F-factors of graphs: A generalized matching problem
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
Approximation algorithms for hard capacitated \(k\)-facility location problems
1-Approximation algorithm for bottleneck disjoint path matching

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)