Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings

DOI10.1007/978-3-642-33314-9_9zbMath1364.68129OpenAlexW52694499MaRDI QIDQ2915140

Nikita Danilenko

Publication date: 21 September 2012

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33314-9_9

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (3)

Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures ⋮ Cardinality of relations with applications ⋮ Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Inductive graphs and functional graph algorithms
• A Functional, Successor List Based Version of Warshall’s Algorithm with Applications
• TWO THEOREMS IN GRAPH THEORY
• Efficient graph algorithms using lazy monolithic arrays
• Functional programming with graphs
• An Approach to Fast Arrays in Haskell
• Algorithms – ESA 2004
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings