A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260): Difference between revisions

@@ Property / cites work @@
+Q4099676
@@ Property / cites work: Q4099676 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+A personnel assignment problem
@@ Property / cites work: A personnel assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching in a convex bipartite graph
@@ Property / cites work: Maximum matching in a convex bipartite graph / rank @@
+Normal rank
@@ Property / cites work @@
+Level Schedules for Mixed-Model, Just-in-Time Processes
+Normal rank
@@ Property / cites work @@
+An 0(n log n) algorithm for the convex bipartite matching problem
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling unit-time tasks with integer release times and deadlines
+Normal rank
@@ Property / cites work @@
+A note on ``Scheduling unit-time tasks with integer release times and deadlines''
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0898-1221(96)00079-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2068928748
@@ Property / OpenAlex ID: W2068928748 / rank @@
+Normal rank