Maximum matching in regular and almost regular graphs (Q1949755): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-012-9625-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2108763491
@@ Property / OpenAlex ID: W2108763491 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252281
@@ Property / cites work: Q4252281 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038720
@@ Property / cites work: Q4038720 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4830805
@@ Property / cites work: Q4830805 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
+Normal rank
@@ Property / cites work @@
+Faster scaling algorithms for general graph matching problems
+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 @@
+Perfect matchings via uniform sampling in regular bipartite graphs
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
+Normal rank