{"id":13004,"date":"2021-12-02T20:37:52","date_gmt":"2021-12-03T01:37:52","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=13004"},"modified":"2026-06-02T14:59:25","modified_gmt":"2026-06-02T18:59:25","slug":"tr-99-04-coarse-grained-parallel-maximum-matching-in-convex-bipartite-graphs","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1999\/tr-99-04-coarse-grained-parallel-maximum-matching-in-convex-bipartite-graphs\/","title":{"rendered":"TR-99-04: Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs"},"content":{"rendered":"\n<section class=\"w-screen px-6 cu-section cu-section--white ml-offset-center md:px-8 lg:px-14\">\n    <div class=\"space-y-6 cu-max-w-child-5xl  md:space-y-10 cu-prose-first-last\">\n\n            <div class=\"cu-textmedia flex flex-col lg:flex-row mx-auto gap-6 md:gap-10 my-6 md:my-12 first:mt-0 max-w-5xl\">\n        <div class=\"justify-start cu-textmedia-content cu-prose-first-last\" style=\"flex: 0 0 100%;\">\n            <header class=\"font-light prose-xl cu-pageheader md:prose-2xl cu-component-updated cu-prose-first-last\">\n                                    <h1 class=\"cu-prose-first-last font-semibold !mt-2 mb-4 md:mb-6 relative after:absolute after:h-px after:bottom-0 after:bg-cu-red after:left-px text-3xl md:text-4xl lg:text-5xl lg:leading-[3.5rem] pb-5 after:w-10 text-cu-black-700 not-prose\">\n                        TR-99-04: Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs\n                    <\/h1>\n                \n                                \n                            <\/header>\n\n                    <\/div>\n\n            <\/div>\n\n    <\/div>\n<\/section>\n\n<p>Carleton University<br>\n<a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1999\/\">Technical Report<\/a> TR-99-04<br>\nJanuary 1999<\/p>\n\n\n\n<h2 id=\"coarse-grained-parallel-maximum-matching-in-convex-bipartite-graphs\" class=\"wp-block-heading\">Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs<\/h2>\n\n\n\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">P. Bose, A. Chan, Frank Dehne, M. Latzel<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<div>\n<h3>Abstract<\/h3>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n<p>We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = (A, B, E). For p processors with N\/p memory per processor, N = |A|+|B|, N\/p &gt;= p, the algorithm requires Oh(log p) communication rounds and Oh(T_sequ(n\/p,m\/p) + n\/p log p) local computation, where n = |A|, m = |B| and T_sequ(n,m) is the sequential time complexity for the problem. For the BSP model, this implies O(log p) supersteps with O(gN +g n\/p log p) communication cost and O(T_sequ(n\/p,m\/p) + n\/p log p) local computation.<\/p>\n\n\n\n<p><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-99-04.pdf\">TR-99-04.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Carleton University Technical Report TR-99-04 January 1999 Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs P. Bose, A. Chan, Frank Dehne, M. Latzel Abstract We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = (A, B, E). For p processors with N\/p memory per processor, [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":12244,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-13004","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13004","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=13004"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13004\/revisions"}],"predecessor-version":[{"id":13005,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13004\/revisions\/13005"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12244"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=13004"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=13004"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}