An algorithm for computing the matching capacity

DOI10.1016/J.AML.2004.02.009zbMATH Open1077.94011OpenAlexW1990238611MaRDI QIDQ2484637FDOQ2484637

Authors: Suren Arzumanyan 

Publication date: 1 August 2005

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2004.02.009

Recommendations

• Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
• scientific article; zbMATH DE number 67678
• Faster scaling algorithms for general graph matching problems
• On the maximum 2-1 matching
• An efficient algorithm for the bipartite matching problem

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Matching theory
• Title not available (Why is that?)
• Matrix versions of the Cauchy and Kantorovich inequalities
• Information and control: matching channels

Cited In (3)

• An efficient matching algorithm applied in statistical physics
• A moment-matching Ferguson \& Klass algorithm
• Title not available (Why is that?)

This page was built for publication: An algorithm for computing the matching capacity

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