{"id":"https://openalex.org/W2913012475","doi":"https://doi.org/10.1007/s00453-011-9546-x","title":"Exact Algorithms for Edge Domination","display_name":"Exact Algorithms for Edge Domination","publication_year":2011,"publication_date":"2011-07-05","ids":{"openalex":"https://openalex.org/W2913012475","doi":"https://doi.org/10.1007/s00453-011-9546-x","mag":"2913012475"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-011-9546-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-011-9546-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-011-9546-x.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-011-9546-x.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055143803","display_name":"Johan M. M. van Rooij","orcid":"https://orcid.org/0000-0001-9149-4162"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Johan M. M. van Rooij","raw_affiliation_strings":["Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055143803"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":5.0216,"has_fulltext":true,"cited_by_count":38,"citation_normalized_percentile":{"value":0.95973643,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"64","issue":"4","first_page":"535","last_page":"563"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9983999729156494,"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/dominating-set","display_name":"Dominating set","score":0.6981903910636902},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6559119820594788},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6029411554336548},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5808120965957642},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5244139432907104},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.49874162673950195},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4810538589954376},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4602867662906647},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.44388338923454285},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3818384110927582},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3651367425918579},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2909289300441742},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18633103370666504}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6981903910636902},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6559119820594788},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6029411554336548},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5808120965957642},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5244139432907104},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.49874162673950195},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4810538589954376},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4602867662906647},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.44388338923454285},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3818384110927582},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3651367425918579},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2909289300441742},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18633103370666504},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-011-9546-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-011-9546-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-011-9546-x.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-011-9546-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-011-9546-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-011-9546-x.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2913012475.pdf","grobid_xml":"https://content.openalex.org/works/W2913012475.grobid-xml"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W716692","https://openalex.org/W66071877","https://openalex.org/W143512583","https://openalex.org/W173980447","https://openalex.org/W282776240","https://openalex.org/W1525726608","https://openalex.org/W1537449969","https://openalex.org/W1563108031","https://openalex.org/W1582963151","https://openalex.org/W1593174338","https://openalex.org/W1593916827","https://openalex.org/W1666834859","https://openalex.org/W1969186119","https://openalex.org/W1983156760","https://openalex.org/W1988133548","https://openalex.org/W1993301031","https://openalex.org/W2003427112","https://openalex.org/W2007200873","https://openalex.org/W2007940874","https://openalex.org/W2013568176","https://openalex.org/W2014430206","https://openalex.org/W2035700242","https://openalex.org/W2038049091","https://openalex.org/W2059608229","https://openalex.org/W2061513598","https://openalex.org/W2066749637","https://openalex.org/W2067264828","https://openalex.org/W2073025989","https://openalex.org/W2089718638","https://openalex.org/W2093776691","https://openalex.org/W2094077034","https://openalex.org/W2094730987","https://openalex.org/W2096495231","https://openalex.org/W2097844290","https://openalex.org/W2103164681","https://openalex.org/W2107351840","https://openalex.org/W2115147103","https://openalex.org/W2119774304","https://openalex.org/W2127390687","https://openalex.org/W2143996311","https://openalex.org/W2154399201","https://openalex.org/W2535182880","https://openalex.org/W2561675875","https://openalex.org/W2799004609","https://openalex.org/W4213214460","https://openalex.org/W4213368513","https://openalex.org/W4233756358","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4287795162","https://openalex.org/W3023069363","https://openalex.org/W4362737182","https://openalex.org/W922283457","https://openalex.org/W2911925523","https://openalex.org/W2010333092","https://openalex.org/W1621490777","https://openalex.org/W4285261572","https://openalex.org/W2611334166","https://openalex.org/W2104330975"],"abstract_inverted_index":{"An":[0],"edge":[1,18,27,35,192,220],"dominating":[2,36,193,221,229],"set":[3,37,230],"in":[4,19,28,74,118,160,170,206,235],"a":[5,9,45,102,131,146,176],"graph":[6,77],"G=(V,E)":[7],"is":[8,21,41,87,97,106,135],"subset":[10],"of":[11,32,38,70,111,124,139,148,216],"the":[12,75,79,90,115,119,125,156,161,171,187,217,227,247],"edges":[13],"D\u2286E":[14],"such":[15],"that":[16,186],"every":[17],"E":[20],"adjacent":[22],"or":[23],"equal":[24],"to":[25],"some":[26],"D.":[29],"The":[30,64,95],"problem":[31,231,253],"finding":[33],"an":[34,67,258],"minimum":[39,190,195,199,249],"cardinality":[40],"NP-hard.":[42],"We":[43,183],"present":[44],"faster":[46,154],"exact":[47],"exponential":[48],"time":[49,60,85,165,210,239,263],"algorithm":[50,55,65,96,104,127,169,218],"for":[51,219,243,254],"this":[52,144],"problem.":[53],"Our":[54],"uses":[56],"O(1.3226":[57,162,207,236],"n":[58,163,208],")":[59,164,209,238,262],"and":[61,81,92,121,130,198,211,240,246,264],"polynomial":[62,212,241],"space.":[63],"combines":[66],"enumeration":[68],"approach":[69],"minimal":[71],"vertex":[72],"covers":[73],"input":[76],"with":[78,101],"branch":[80],"reduce":[82],"paradigm.":[83],"Its":[84],"bound":[86,178],"obtained":[88,98],"using":[89,214],"measure":[91,120],"conquer":[93,122],"technique.":[94],"by":[99],"starting":[100],"slower":[103],"which":[105,232,255],"refined":[107],"stepwisely.":[108],"In":[109,143,223],"each":[110,151,168],"these":[112,140],"refinement":[113],"steps,":[114],"worst":[116,141],"cases":[117],"analysis":[123],"current":[126],"are":[128],"reconsidered":[129],"new":[132],"branching":[133],"strategy":[134],"proposed":[136],"on":[137,179],"one":[138,152],"cases.":[142],"way":[145],"series":[147],"algorithms":[149],"appears,":[150],"slightly":[153],"than":[155],"previous":[157],"one,":[158],"ending":[159],"algorithm.":[166,266],"For":[167],"series,":[172],"we":[173,225,233,256],"also":[174,184],"give":[175],"lower":[177],"its":[180],"running":[181],"time.":[182],"show":[185],"related":[188],"problems:":[189],"weight":[191,200,250],"set,":[194],"maximal":[196,201,251],"matching":[197,202,252],"can":[203],"be":[204],"solved":[205],"space":[213,242,265],"modifications":[215],"set.":[222],"addition,":[224],"consider":[226],"matrix":[228],"solve":[234],"n+m":[237],"n\u00d7m":[244],"matrices,":[245],"parametrised":[248],"obtain":[257],"O":[259],"\u2217(2.4179":[260],"k":[261]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}