{"id":12782,"date":"2021-11-21T16:50:09","date_gmt":"2021-11-21T21:50:09","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12782"},"modified":"2026-06-02T14:59:25","modified_gmt":"2026-06-02T18:59:25","slug":"tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/","title":{"rendered":"TR-95-12: An Improved Maximum Matching Algorithm in a Permutation Graph"},"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-95-12: An Improved Maximum Matching Algorithm in a Permutation Graph\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-1995\/\">Technical Report<\/a> TR-95-12<br>\nMay 1995<\/p>\n\n\n\n<h2 id=\"an-improved-maximum-matching-algorithm-in-a-permutation-graph\" class=\"wp-block-heading tr_t1\">An Improved Maximum Matching Algorithm in a Permutation Graph<\/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\">Frank Bauernoppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jorg-Rudiger Sack, Jorge Urrutia<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n<div>\n<h3>Abstract<\/h3>\n<\/div>\n\n\n\n<p class=\"tr_abstract\">We present an O(n log2 n) time algorithm for computing a maximum matching in a per- mutation graph on n-vertices. Our results are based on the algorithm of [12] for a two processor scheduling problem of [2]. The algorithm of [12] runs in O(n + m) time, where n and m are the vertices and dependencies, respectively of the given graph. Through vector dominance and using computational geometry techniques we provide a novel and improved algorithm for maximum matching in permutation graphs. We establish that the problem has an O(n log2 n) solution. Furthermore, if the dependency graph of a scheduling problem is known to be a permutation graph, then we now have an improved two-processor scheduling algorithm (if the number of edges is (n log2 n)).<\/p>\n\n\n\n<p><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-12.pdf\">TR-95-12.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Carleton University Technical Report TR-95-12 May 1995 An Improved Maximum Matching Algorithm in a Permutation Graph Frank Bauernoppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jorg-Rudiger Sack, Jorge Urrutia Abstract We present an O(n log2 n) time algorithm for computing a maximum matching in a per- mutation graph on n-vertices. Our results are based on the [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11736,"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-12782","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12782","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=12782"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12782\/revisions"}],"predecessor-version":[{"id":12783,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12782\/revisions\/12783"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11736"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12782"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=12782"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}