Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings (Q2915140): Difference between revisions

@@ Property / describes a project that uses @@
+Haskell
@@ Property / describes a project that uses: Haskell / 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/978-3-642-33314-9_9
+Normal rank
@@ Property / OpenAlex ID @@
+W52694499
@@ Property / OpenAlex ID: W52694499 / rank @@
+Normal rank
@@ Property / cites work @@
+TWO THEOREMS IN GRAPH THEORY
@@ Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+Q3518423
@@ Property / cites work: Q3518423 / rank @@
+Normal rank
@@ Property / cites work @@
+A Functional, Successor List Based Version of Warshall’s Algorithm with Applications
+Normal rank
@@ Property / cites work @@
+An Approach to Fast Arrays in Haskell
@@ Property / cites work: An Approach to Fast Arrays in Haskell / rank @@
+Normal rank
@@ Property / cites work @@
+Functional programming with graphs
@@ Property / cites work: Functional programming with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Inductive graphs and functional graph algorithms
@@ Property / cites work: Inductive graphs and functional graph algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Efficient graph algorithms using lazy monolithic arrays
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4877161
@@ Property / cites work: Q4877161 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2915140