scientific article; zbMATH DE number 842126

MaRDI QIDQ4862294zbMATH OpenFDO

Authors Jens Clausen, Jakob Krarup

Publication date 6 February 1996

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
• The uniquely solvable bipartite matching problem
• Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs
• Finding all maximally-matchable edges in a bipartite graph
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem

Cited in

(3)

• Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
• New inequalities for network distance measures by using graph spectra
• On conjectures of network distance measures by using graph spectra

This page was built for publication:

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