{"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":"2021-11-21T16:50:09","modified_gmt":"2021-11-21T21:50:09","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":"

Carleton University
\nTechnical Report<\/a> TR-95-12
\nMay 1995<\/p>\n

An Improved Maximum Matching Algorithm in a Permutation Graph<\/h2>\n
\n
\n
\n
\n
Frank Bauernoppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jorg-Rudiger Sack, Jorge Urrutia<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

Abstract<\/h3>\n<\/div>\n

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

TR-95-12.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

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 […]<\/p>\n","protected":false},"author":49,"featured_media":0,"parent":11736,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_relevanssi_hide_post":"","_relevanssi_hide_content":"","_relevanssi_pin_for_all":"","_relevanssi_pin_keywords":"","_relevanssi_unpin_keywords":"","_relevanssi_related_keywords":"","_relevanssi_related_include_ids":"","_relevanssi_related_exclude_ids":"","_relevanssi_related_no_append":"","_relevanssi_related_not_related":"","_relevanssi_related_posts":"","_relevanssi_noindex_reason":"","_mi_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":"","_links_to":"","_links_to_target":""},"yoast_head":"\nTR-95-12: An Improved Maximum Matching Algorithm in a Permutation Graph - School of Computer Science<\/title>\n<meta name=\"description\" content=\"Carleton University Technical Report TR-95-12 May 1995 An Improved Maximum Matching Algorithm in a Permutation Graph Frank Bauernoppel, Evangelos\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/\",\"url\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/\",\"name\":\"TR-95-12: An Improved Maximum Matching Algorithm in a Permutation Graph - School of Computer Science\",\"isPartOf\":{\"@id\":\"https:\/\/carleton.ca\/scs\/#website\"},\"datePublished\":\"2021-11-21T21:50:09+00:00\",\"dateModified\":\"2021-11-21T21:50:09+00:00\",\"description\":\"Carleton University Technical Report TR-95-12 May 1995 An Improved Maximum Matching Algorithm in a Permutation Graph Frank Bauernoppel, Evangelos\",\"breadcrumb\":{\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/carleton.ca\/scs\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Research\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"SCS Technical Reports\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"Technical Reports 1995\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/\"},{\"@type\":\"ListItem\",\"position\":5,\"name\":\"TR-95-12: An Improved Maximum Matching Algorithm in a Permutation Graph\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/carleton.ca\/scs\/#website\",\"url\":\"https:\/\/carleton.ca\/scs\/\",\"name\":\"School of Computer Science\",\"description\":\"Carleton University\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/carleton.ca\/scs\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"TR-95-12: An Improved Maximum Matching Algorithm in a Permutation Graph - School of Computer Science","description":"Carleton University Technical Report TR-95-12 May 1995 An Improved Maximum Matching Algorithm in a Permutation Graph Frank Bauernoppel, Evangelos","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/","twitter_misc":{"Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/","url":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/","name":"TR-95-12: An Improved Maximum Matching Algorithm in a Permutation Graph - School of Computer Science","isPartOf":{"@id":"https:\/\/carleton.ca\/scs\/#website"},"datePublished":"2021-11-21T21:50:09+00:00","dateModified":"2021-11-21T21:50:09+00:00","description":"Carleton University Technical Report TR-95-12 May 1995 An Improved Maximum Matching Algorithm in a Permutation Graph Frank Bauernoppel, Evangelos","breadcrumb":{"@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/carleton.ca\/scs\/"},{"@type":"ListItem","position":2,"name":"Research","item":"https:\/\/carleton.ca\/scs\/research\/"},{"@type":"ListItem","position":3,"name":"SCS Technical Reports","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/"},{"@type":"ListItem","position":4,"name":"Technical Reports 1995","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/"},{"@type":"ListItem","position":5,"name":"TR-95-12: An Improved Maximum Matching Algorithm in a Permutation Graph"}]},{"@type":"WebSite","@id":"https:\/\/carleton.ca\/scs\/#website","url":"https:\/\/carleton.ca\/scs\/","name":"School of Computer Science","description":"Carleton University","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/carleton.ca\/scs\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"}]}},"acf":{"banner_image_type":"none","banner_button":"no"},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12782"}],"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\/49"}],"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"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}