{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:48:13Z","timestamp":1725893293797},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642333132"},{"type":"electronic","value":"9783642333149"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33314-9_9","type":"book-chapter","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T04:05:18Z","timestamp":1347422718000},"page":"130-145","source":"Crossref","is-referenced-by-count":2,"title":["Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings"],"prefix":"10.1007","author":[{"given":"Nikita","family":"Danilenko","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"The Haskell report, \n                    \n                      http:\/\/www.haskell.org\/onlinereport\/haskell2010"},{"issue":"9","key":"9_CR2","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"Berge, C.: Two theorems in graph theory. PNAS. National Academy of Sciences\u00a043(9), 842\u2013844 (1957)","journal-title":"PNAS. National Academy of Sciences"},{"key":"9_CR3","unstructured":"Berghammer, R.: Ordnungen, Verb\u00e4nde und Relationen mit Anwendungen. Vieweg-Teubner (2008)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-21070-9_10","volume-title":"Relational and Algebraic Methods in Computer Science","author":"R. Berghammer","year":"2011","unstructured":"Berghammer, R.: A Functional, Successor List Based Version of Warshall\u2019s Algorithm with Applications. In: de Swart, H. (ed.) RAMICS 2011. LNCS, vol.\u00a06663, pp. 109\u2013124. Springer, Heidelberg (2011)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-44833-4_2","volume-title":"Advanced Functional Programming","author":"M.M.T. Chakravarty","year":"2003","unstructured":"Chakravarty, M.M.T., Keller, G.: An Approach to Fast Arrays in Haskell. In: Jeuring, J., Jones, S.L.P. (eds.) AFP 2002. LNCS, vol.\u00a02638, pp. 27\u201358. Springer, Heidelberg (2003)"},{"key":"9_CR6","unstructured":"Diestel, R.: Graphentheorie. Springer (2000)"},{"key":"9_CR7","unstructured":"Erwig, M.: The FGL package, \n                    \n                      http:\/\/hackage.haskell.org\/package\/fgl"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Erwig, M.: Functional programming with graphs. In: Jones, S.L.P., Tofte, M., Berman, A.M. (eds.) ICFP, pp. 52\u201365. ACM (1997)","DOI":"10.1145\/258949.258955"},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1017\/S0956796801004075","volume":"11","author":"M. Erwig","year":"2001","unstructured":"Erwig, M.: Inductive graphs and functional graph algorithms. J. Funct. Program.\u00a011(5), 467\u2013492 (2001)","journal-title":"J. Funct. Program."},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput.\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1017\/S0956796898003062","volume":"8","author":"T. Johnsson","year":"1998","unstructured":"Johnsson, T.: Efficient graph algorithms using lazy monolithic arrays. J. Funct. Program.\u00a08(4), 323\u2013333 (1998)","journal-title":"J. Funct. Program."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"King, D.J., Launchbury, J.: Structuring depth-first search algorithms in Haskell. In: POPL, pp. 344\u2013354 (1995)","DOI":"10.1145\/199448.199530"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-59451-5_9","volume-title":"Advanced Functional Programming","author":"J. Launchbury","year":"1995","unstructured":"Launchbury, J.: Graph Algorithms with a Functional Flavour. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol.\u00a0925, pp. 308\u2013331. Springer, Heidelberg (1995)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Launchbury, J., Jones, S.L.P.: Lazy functional state threads. In: PLDI, pp. 24\u201335 (1994)","DOI":"10.1145\/773473.178246"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-27694-1_12","volume-title":"Practical Aspects of Declarative Languages","author":"M. Lesniak","year":"2012","unstructured":"Lesniak, M.: Palovca: Describing and Executing Graph Algorithms in Haskell. In: Russo, C., Zhou, N.-F. (eds.) PADL 2012. LNCS, vol.\u00a07149, pp. 153\u2013167. Springer, Heidelberg (2012)"},{"key":"9_CR16","unstructured":"Lipovaca, M.: Learn You a Haskell for Great Good!. No Starch Press (2011), \n                    \n                      http:\/\/learnyouahaskell.com"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings via Gaussian elimination. In: FOCS, pp. 248\u2013255. IEEE Computer Society (2004)","DOI":"10.1007\/978-3-540-30140-0_48"},{"key":"9_CR18","unstructured":"Okasaki, C., Gill, A.: Fast mergeable integer maps. In: Workshop on ML, pp. 77\u201386 (1998)"},{"key":"9_CR19","unstructured":"O\u2019Sullivan, B., Stewart, D., Goerzen, J.: Real World Haskell. O\u2019Reilly (2009), \n                    \n                      http:\/\/book.realworldhaskell.org\/read"},{"key":"9_CR20","unstructured":"Rabhi, F., Lapalme, G.: Algorithms: a functional programming approach, 2nd edn. Addison-Wesley (1999)"},{"key":"9_CR21","unstructured":"Russling, M.: Deriving General Schemes for Classes of Graph Algorithms. PhD thesis (1996)"},{"key":"9_CR22","unstructured":"Smith, L.: The data-ordlist package, \n                    \n                      http:\/\/hackage.haskell.org\/package\/data-ordlist"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33314-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T09:24:09Z","timestamp":1557221049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33314-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642333132","9783642333149"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33314-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}