{"id":"https://openalex.org/W1999724243","doi":"https://doi.org/10.1145/1120725.1120954","title":"A fast algorithm for finding common multiple-vertex dominators in circuit graphs","display_name":"A fast algorithm for finding common multiple-vertex dominators in circuit graphs","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1999724243","doi":"https://doi.org/10.1145/1120725.1120954","mag":"1999724243"},"language":"en","primary_location":{"id":"doi:10.1145/1120725.1120954","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1120725.1120954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 conference on Asia South Pacific design automation - ASP-DAC '05","raw_type":"proceedings-article"},"type":"conference-abstract","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/A5040692022","display_name":"Ren\u00e9 Krenz","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ren\u00e9 Krenz","raw_affiliation_strings":["IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden","IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden#TAB#","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011438358","display_name":"Elena Dubrova","orcid":"https://orcid.org/0000-0001-7382-9408"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Elena Dubrova","raw_affiliation_strings":["IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden","IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"IMIT-KTH, Royal Institute of Technology, Stockholm, Sweden#TAB#","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"529","last_page":"529"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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.9994000196456909,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.684855043888092},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6284120678901672},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6061232686042786},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.5335481762886047},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.46537157893180847},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33771270513534546},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21543791890144348},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.19099366664886475}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.684855043888092},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6284120678901672},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6061232686042786},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.5335481762886047},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.46537157893180847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33771270513534546},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21543791890144348},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.19099366664886475}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1120725.1120954","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1120725.1120954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 conference on Asia South Pacific design automation - ASP-DAC '05","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1839615380","https://openalex.org/W1976357819","https://openalex.org/W1985245264","https://openalex.org/W1989787788","https://openalex.org/W2003312024","https://openalex.org/W2008441811","https://openalex.org/W2018368463","https://openalex.org/W2044560939","https://openalex.org/W2049105156","https://openalex.org/W2092576944","https://openalex.org/W2096554094","https://openalex.org/W2105715355","https://openalex.org/W2111379929","https://openalex.org/W2116305334","https://openalex.org/W2124339980","https://openalex.org/W2133246738","https://openalex.org/W2158102622","https://openalex.org/W3141004699"],"related_works":["https://openalex.org/W3151473321","https://openalex.org/W2060407451","https://openalex.org/W2356825047","https://openalex.org/W2389109338","https://openalex.org/W2078076811","https://openalex.org/W2367407624","https://openalex.org/W2584195379","https://openalex.org/W2170042072","https://openalex.org/W640542947","https://openalex.org/W2348129335"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"a":[5,64],"fast":[6],"algorithm":[7],"for":[8],"computing":[9],"common":[10,88],"multiple-vertex":[11,89],"dominators":[12,46,56,68,90],"in":[13,20,47,57],"circuit":[14,58],"graphs.":[15],"Dominators":[16],"are":[17],"widely":[18],"used":[19],"CAD":[21],"applications":[22],"such":[23],"as":[24],"satisfiability":[25],"checking,":[26,28],"equivalence":[27],"ATPG,":[29],"technology":[30],"mapping,":[31],"decomposition":[32],"of":[33,40,54,63,67,72],"Boolean":[34],"functions":[35],"and":[36,69,85],"power":[37],"optimization.":[38],"State":[39],"the":[41,51,61,70],"art":[42],"algorithms":[43,73],"compute":[44,75],"single-vertex":[45,55],"linear":[48],"time.":[49],"However,":[50],"rare":[52],"appearance":[53],"graphs":[59],"requires":[60],"investigation":[62],"broader":[65],"type":[66],"development":[71],"to":[74],"them.":[76],"We":[77],"show":[78],"that":[79],"our":[80],"new":[81],"technique":[82],"is":[83],"faster":[84],"computes":[86],"more":[87],"than":[91],"existing":[92],"techniques.":[93]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}