Blossom V: A new implementation of a minimum cost perfect matching algorithm (Q734352): Difference between revisions

@@ Property / describes a project that uses @@
+Blossom IV
@@ Property / describes a project that uses: Blossom IV / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+LEDA
@@ Property / describes a project that uses: LEDA / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Triangle
@@ Property / describes a project that uses: Triangle / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+VLSI
@@ Property / describes a project that uses: VLSI / rank @@
+Normal rank
@@ 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.1007/s12532-009-0002-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2164424155
@@ Property / OpenAlex ID: W2164424155 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4283461
@@ Property / cites work: Q4283461 / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of alternative strategies for implementing matching algorithms
+Normal rank
@@ Property / cites work @@
+Recursive Star-Tree Parallel Data Structure
@@ Property / cites work: Recursive Star-Tree Parallel Data Structure / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Minimum-Weight Perfect Matchings
@@ Property / cites work: Computing Minimum-Weight Perfect Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+On the use of optimal fractional matchings for solving the (integer) matching problem
+Normal rank
@@ Property / cites work @@
+Solving (large scale) matching problems combinatorially
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+The pairing heap: A new form of self-adjusting heap
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4400848
@@ Property / cites work: Q4400848 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4276004
@@ Property / cites work: Q4276004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4702188
@@ Property / cites work: Q4702188 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4037436
@@ Property / cites work: Q4037436 / rank @@
+Normal rank
@@ Property / cites work @@
+An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
+Normal rank