{"id":"https://openalex.org/W2916965296","doi":"https://doi.org/10.1145/3301297","title":"Solving Graph Problems via Potential Maximal Cliques","display_name":"Solving Graph Problems via Potential Maximal Cliques","publication_year":2019,"publication_date":"2019-02-18","ids":{"openalex":"https://openalex.org/W2916965296","doi":"https://doi.org/10.1145/3301297","mag":"2916965296"},"language":"en","primary_location":{"id":"doi:10.1145/3301297","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3301297","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10138/309131","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080387266","display_name":"Tuukka Korhonen","orcid":"https://orcid.org/0000-0003-0861-6515"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Tuukka Korhonen","raw_affiliation_strings":["University of Helsinki, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012730467","display_name":"Jeremias Berg","orcid":"https://orcid.org/0000-0001-7660-8061"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Jeremias Berg","raw_affiliation_strings":["University of Helsinki, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081120128","display_name":"Matti J\u0084\u00e4rvisalo","orcid":"https://orcid.org/0000-0003-2572-063X"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Matti J\u00e4rvisalo","raw_affiliation_strings":["University of Helsinki, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6172,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.84908384,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":null,"first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6641900539398193},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.6252973079681396},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6164130568504333},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5507494211196899},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4945985972881317},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.454049676656723},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.43964678049087524},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4258817732334137},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.41847294569015503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40363457798957825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4022237956523895},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37065553665161133},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.15953847765922546},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08207184076309204}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6641900539398193},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6252973079681396},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6164130568504333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5507494211196899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4945985972881317},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.454049676656723},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.43964678049087524},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4258817732334137},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.41847294569015503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40363457798957825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4022237956523895},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37065553665161133},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.15953847765922546},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08207184076309204},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3301297","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3301297","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:helda.helsinki.fi:10138/309131","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/309131","pdf_url":null,"source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:helda.helsinki.fi:10138/309131","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/309131","pdf_url":null,"source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G51798210","display_name":null,"funder_award_id":"251170 COIN, 276412, 284591, and 312662","funder_id":"https://openalex.org/F4320321108","funder_display_name":"Academy of Finland"}],"funders":[{"id":"https://openalex.org/F4320321108","display_name":"Academy of Finland","ror":"https://ror.org/05k73zm37"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W99828349","https://openalex.org/W116541839","https://openalex.org/W855876416","https://openalex.org/W959344381","https://openalex.org/W1542253039","https://openalex.org/W1569612812","https://openalex.org/W1587990862","https://openalex.org/W1593793857","https://openalex.org/W1628915153","https://openalex.org/W1910464128","https://openalex.org/W1968041356","https://openalex.org/W1969259020","https://openalex.org/W1978452004","https://openalex.org/W1979091081","https://openalex.org/W1980452149","https://openalex.org/W1982333717","https://openalex.org/W1983022219","https://openalex.org/W1985733932","https://openalex.org/W1991477862","https://openalex.org/W2010030994","https://openalex.org/W2021989496","https://openalex.org/W2023952346","https://openalex.org/W2027562075","https://openalex.org/W2029448190","https://openalex.org/W2030064859","https://openalex.org/W2031076941","https://openalex.org/W2033325972","https://openalex.org/W2037106315","https://openalex.org/W2038049091","https://openalex.org/W2047033531","https://openalex.org/W2055916047","https://openalex.org/W2066867008","https://openalex.org/W2067692416","https://openalex.org/W2083408803","https://openalex.org/W2086119402","https://openalex.org/W2087083200","https://openalex.org/W2098409879","https://openalex.org/W2109270084","https://openalex.org/W2118348286","https://openalex.org/W2124174860","https://openalex.org/W2125895230","https://openalex.org/W2185680923","https://openalex.org/W2231883621","https://openalex.org/W2407856297","https://openalex.org/W2529734256","https://openalex.org/W2580755689","https://openalex.org/W2592611715","https://openalex.org/W2609498700","https://openalex.org/W2624220145","https://openalex.org/W2794267717","https://openalex.org/W2914617426","https://openalex.org/W2993883515"],"related_works":["https://openalex.org/W1944809474","https://openalex.org/W4297273576","https://openalex.org/W1973679146","https://openalex.org/W3204965069","https://openalex.org/W2370949144","https://openalex.org/W2594848484","https://openalex.org/W3172969885","https://openalex.org/W2156861518","https://openalex.org/W3101608704","https://openalex.org/W2338621810"],"abstract_inverted_index":{"The":[0],"BT":[1,38,87,132,148,168],"algorithm":[2,39,60,169],"of":[3,46,58,82,85,126,131,147,154,166,177,186],"Bouchitt\u00e9":[4],"and":[5,18,64,100,116,119],"Todinca":[6],"based":[7,89],"on":[8,54,66,69,90,128,143,157],"enumerating":[9],"potential":[10],"maximal":[11],"cliques,":[12],"originally":[13],"proposed":[14],"for":[15,27,61,133],"the":[16,37,59,86,96,120,145,158,167,178],"treewidth":[17],"minimum":[19,113],"fill-in":[20],"problems,":[21],"yields":[22,170],"improved":[23],"exact":[24],"exponential-time":[25],"algorithms":[26],"various":[28],"graph":[29,110],"optimization":[30,130],"problems":[31,63,180],"related":[32,109],"to":[33,107,151,175,183],"optimal":[34],"triangulations.":[35],"While":[36],"has":[40,51],"received":[41],"significant":[42],"attention":[43,50],"in":[44,72,95,139],"terms":[45],"theoretical":[47],"analysis,":[48],"less":[49],"been":[52],"paid":[53],"engineering":[55],"efficient":[56,164],"implementations":[57,185],"different":[62],"thereby":[65],"empirical":[67],"studies":[68],"its":[70],"effectiveness":[71],"practice.":[73],"In":[74],"this":[75,140],"work,":[76],"we":[77,160],"provide":[78],"an":[79,83,163,171],"experimental":[80],"evaluation":[81],"implementation":[84,165],"algorithm,":[88],"our":[91,137],"second-place":[92],"winning":[93],"entry":[94],"2nd":[97],"Parameterized":[98],"Algorithms":[99],"Computational":[101],"Experiments":[102],"Challenge":[103],"(PACE":[104],"2017),":[105],"extended":[106],"several":[108],"problems:":[111],"treewidth,":[112],"fill-in,":[114],"generalized":[115],"fractional":[117],"hypertreewidth,":[118],"total":[121],"table":[122],"size":[123],"problem.":[124],"Instead":[125],"focusing":[127],"problem-specific":[129,188],"a":[134,152],"particular":[135],"problem,":[136],"focus":[138],"work":[141],"is":[142],"studying":[144],"applicability":[146],"more":[149],"generally":[150],"range":[153],"problems.":[155],"Based":[156],"results,":[159],"conclude":[161],"that":[162],"empirically":[172],"competitive":[173],"approach":[174],"each":[176],"considered":[179],"when":[181],"compared":[182],"available":[184],"alternative":[187],"algorithmic":[189],"approaches.":[190]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2019-03-02T00:00:00"}