Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (Q1337676): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
+Normal rank
@@ Property / cites work @@
+Solving linear bottleneck assignment problems via strong spanning trees
+Normal rank
@@ Property / cites work @@
+An augmenting path method for solving linear bottleneck assignment problems
+Normal rank
@@ Property / cites work @@
+Algorithms for two bottleneck optimization problems
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1337676