{"id":"https://openalex.org/W171202931","doi":"https://doi.org/10.1090/dimacs/069/18","title":"A dynamic programming approach for timing and designing clique algorithms","display_name":"A dynamic programming approach for timing and designing clique algorithms","publication_year":2007,"publication_date":"2007-06-07","ids":{"openalex":"https://openalex.org/W171202931","doi":"https://doi.org/10.1090/dimacs/069/18","mag":"171202931"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/069/18","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/069/18","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037417281","display_name":"Wendy Myrvold","orcid":"https://orcid.org/0000-0002-0401-013X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wendy Myrvold","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024375093","display_name":"Tania Prsa","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tania Prsa","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111460017","display_name":"Neil Walker","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neil Walker","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037417281"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3403,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.5665591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"333","last_page":"340"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9955999851226807,"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/T10142","display_name":"Formal Methods in Verification","score":0.9955999851226807,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9768999814987183,"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.9764000177383423,"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/clique","display_name":"Clique","score":0.7194226980209351},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6354756355285645},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.49504175782203674},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.48800936341285706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42242950201034546},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2574049234390259},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16584691405296326},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.05326676368713379}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7194226980209351},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6354756355285645},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.49504175782203674},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.48800936341285706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42242950201034546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2574049234390259},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16584691405296326},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.05326676368713379},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1090/dimacs/069/18","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/069/18","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.6608","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.6608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://godot.uvic.ca/pub/Publications/Myrvold/clique.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.54.7118","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.7118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rtm.science.unitn.it/alex98/book/clique.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2165678151","https://openalex.org/W1796509207","https://openalex.org/W2082603400","https://openalex.org/W3203939381","https://openalex.org/W2140498717","https://openalex.org/W858234464","https://openalex.org/W4285171291","https://openalex.org/W2162082186","https://openalex.org/W2951533720","https://openalex.org/W2389368518"],"abstract_inverted_index":{"Traditionally,":[0],"practical":[1],"clique":[2,117],"algorithms":[3,113,150],"have":[4],"been":[5],"compared":[6],"based":[7],"on":[8,11],"their":[9],"performance":[10],"various":[12],"random":[13],"graphs.":[14],"We":[15,63],"propose":[16],"a":[17,28,74],"new":[18,112],"testing":[19,23,42],"methodology":[20],"which":[21,125,151],"permits":[22],"to":[24,46,87,105,109],"be":[25,44,52],"completed":[26],"in":[27,54],"fraction":[29],"of":[30,41,58,146],"the":[31,39,55,68,84,115,130,135,144],"time":[32,61,85],"required":[33,86],"by":[34,66],"previous":[35],"methods.":[36],"In":[37],"addition,":[38],"range":[40],"can":[43],"extended":[45],"include":[47],"problems":[48],"that":[49,70,132],"could":[50],"not":[51],"attempted":[53],"past":[56],"because":[57],"being":[59],"too":[60],"consuming.":[62],"accomplish":[64],"this":[65,99,107],"applying":[67],"approach":[69,138],"makes":[71],"dynamic":[72,136],"programming":[73,137],"very":[75],"effective":[76],"algorithmic":[77],"technique:":[78],"we":[79,142],"use":[80,106],"tabulated":[81],"estimates":[82],"for":[83,114,129,140],"solve":[88],"subproblems":[89,131],"rather":[90],"than":[91],"timing":[92],"each":[93],"exactly.":[94],"Our":[95],"computational":[96],"experiments":[97],"validate":[98],"approach.":[100],"The":[101],"next":[102],"step":[103],"is":[104,122],"workbench":[108],"develop":[110],"fast":[111],"maximum":[116],"problem.":[118],"A":[119],"mixed":[120],"algorithm":[121,124],"an":[123],"applies":[126],"different":[127],"strategies":[128],"arise.":[133],"Using":[134],"again":[139],"timing,":[141],"mechanize":[143],"process":[145],"developing":[147],"table":[148],"driven":[149],"apply":[152],"...":[153]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}