Maximum matching and a polyhedron with 0,1-vertices

1965/01/01 by Jack Edmonds · 5 citations

paper · doi:10.6028/jres.069b.013

crossref issued 1965/01/01 · crossref published 1965/01/01 · crossref published-print 1965/01/01 · crossref created 2012/08/17 · crossref deposited 2024/10/11 · crossref indexed 2026/07/31

Cited by

• Markovian protocols and an upper bound on the extension complexity of the matching polytope
• Overflow-Safe Polylog-Time Parallel Minimum-Weight Perfect Matching Decoder: Toward Experimental Demonstration
• Agent-Q: Fine-Tuning Large Language Models for Quantum Circuit Generation and Optimization
• Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
• Improved approximation algorithms for the EPR Hamiltonian