Persistency in maximum cardinality bipartite matchings (Q1332944): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(94)90049-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2061687898
@@ Property / OpenAlex ID: W2061687898 / 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 @@
+Q5615282
@@ Property / cites work: Q5615282 / rank @@
+Normal rank
@@ Property / cites work @@
+The uniquely solvable bipartite matching problem
@@ Property / cites work: The uniquely solvable bipartite matching problem / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding maximum matching in graphs
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Rank of maximum matchings in a graph
@@ Property / cites work: Rank of maximum matchings in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4217266
@@ Property / cites work: Q4217266 / rank @@
+Normal rank