{"id":13132,"date":"2021-12-06T18:53:37","date_gmt":"2021-12-06T23:53:37","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=13132"},"modified":"2021-12-06T18:55:05","modified_gmt":"2021-12-06T23:55:05","slug":"tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/","title":{"rendered":"TR-05-03: A New Approach for Solving the Maximum Clique Problem"},"content":{"rendered":"

Carleton University
\nTechnical Report<\/a> TR-05-03
\nApril 15, 2005<\/p>\n

A New Approach for Solving the Maximum Clique Problem<\/h2>\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
Peter J. Taillon<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

Abstract<\/h3>\n

In this report, we describe an improved exact algorithm for solving the Maximum Clique problem in a graph using a novel sampling technique combined with the FPT k-vertex cover algorithm. We also introduce a very effective heuristic for finding a maximum clique that combines our sampling approach with fast independent set approximation. Experimental research indicates that this approach matches or outperforms the current best algorithms for finding a maximum clique in a graph, with significantly smaller runtimes.<\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

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

Carleton University Technical Report TR-05-03 April 15, 2005 A New Approach for Solving the Maximum Clique Problem Peter J. Taillon Abstract In this report, we describe an improved exact algorithm for solving the Maximum Clique problem in a graph using a novel sampling technique combined with the FPT k-vertex cover algorithm. We also introduce a […]<\/p>\n","protected":false},"author":49,"featured_media":0,"parent":12337,"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-05-03: A New Approach for Solving the Maximum Clique Problem - School of Computer Science<\/title>\n<meta name=\"description\" content=\"Carleton University Technical Report TR-05-03 April 15, 2005 A New Approach for Solving the Maximum Clique Problem Peter J. Taillon Abstract In this\" \/>\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-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/\" \/>\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-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/\",\"url\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/\",\"name\":\"TR-05-03: A New Approach for Solving the Maximum Clique Problem - School of Computer Science\",\"isPartOf\":{\"@id\":\"https:\/\/carleton.ca\/scs\/#website\"},\"datePublished\":\"2021-12-06T23:53:37+00:00\",\"dateModified\":\"2021-12-06T23:55:05+00:00\",\"description\":\"Carleton University Technical Report TR-05-03 April 15, 2005 A New Approach for Solving the Maximum Clique Problem Peter J. Taillon Abstract In this\",\"breadcrumb\":{\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/#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 2005\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2005\/\"},{\"@type\":\"ListItem\",\"position\":5,\"name\":\"TR-05-03: A New Approach for Solving the Maximum Clique Problem\"}]},{\"@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-05-03: A New Approach for Solving the Maximum Clique Problem - School of Computer Science","description":"Carleton University Technical Report TR-05-03 April 15, 2005 A New Approach for Solving the Maximum Clique Problem Peter J. Taillon Abstract In this","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-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/","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-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/","url":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/","name":"TR-05-03: A New Approach for Solving the Maximum Clique Problem - School of Computer Science","isPartOf":{"@id":"https:\/\/carleton.ca\/scs\/#website"},"datePublished":"2021-12-06T23:53:37+00:00","dateModified":"2021-12-06T23:55:05+00:00","description":"Carleton University Technical Report TR-05-03 April 15, 2005 A New Approach for Solving the Maximum Clique Problem Peter J. Taillon Abstract In this","breadcrumb":{"@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2005\/tr-05-03-a-new-approach-for-solving-the-maximum-clique-problem-2\/#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 2005","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2005\/"},{"@type":"ListItem","position":5,"name":"TR-05-03: A New Approach for Solving the Maximum Clique Problem"}]},{"@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\/13132"}],"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=13132"}],"version-history":[{"count":2,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13132\/revisions"}],"predecessor-version":[{"id":13135,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13132\/revisions\/13135"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12337"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=13132"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}