A shortest augmenting path method for solving minimal perfect matching problems (Q3931440): 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.1002/net.3230110407
+Normal rank
@@ Property / OpenAlex ID @@
+W2058494699
@@ Property / OpenAlex ID: W2058494699 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Q3921016
@@ Property / cites work: Q3921016 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3931440