Finding all maximally-matchable edges in a bipartite graph (Q418005): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 05C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6034859
@@ Property / zbMATH DE Number: 6034859 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bipartite graphs
@@ Property / zbMATH Keywords: bipartite graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+perfect matchings
@@ Property / zbMATH Keywords: perfect matchings / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+maximum matchings
@@ Property / zbMATH Keywords: maximum matchings / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+maximally-matchable edges
@@ Property / zbMATH Keywords: maximally-matchable edges / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56341084
@@ Property / Wikidata QID: Q56341084 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1998124720
@@ Property / OpenAlex ID: W1998124720 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4711
@@ Property / arXiv ID: 1107.4711 / rank @@
+Normal rank
@@ Property / cites work @@
+Database Theory - ICDT 2005
@@ Property / cites work: Database Theory - ICDT 2005 / 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 @@
+Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory
+Normal rank
@@ Property / cites work @@
+Algorithms for dense graphs and networks on the random access computer
+Normal rank
@@ Property / cites work @@
+Persistency in maximum cardinality bipartite matchings
+Normal rank
@@ Property / cites work @@
+Q2921696
@@ Property / cites work: Q2921696 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding all the perfect matchings in bipartite graphs
+Normal rank
@@ Property / cites work @@
+Perfect matchings in o(             <i>n</i>             log             <i>n</i>             ) time in regular bipartite graphs
+Normal rank
@@ Property / cites work @@
+On Representatives of Subsets
@@ Property / cites work: On Representatives of Subsets / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matchings in general graphs through randomization
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4370201
@@ Property / cites work: Q4370201 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474103
@@ Property / cites work: Q4474103 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:418005