{"id":"https://openalex.org/W2110723988","doi":"https://doi.org/10.1109/fpl.2007.4380638","title":"A Hardware Algorithm for the Minimum p-quasi Clique Cover Problem","display_name":"A Hardware Algorithm for the Minimum p-quasi Clique Cover Problem","publication_year":2007,"publication_date":"2007-08-01","ids":{"openalex":"https://openalex.org/W2110723988","doi":"https://doi.org/10.1109/fpl.2007.4380638","mag":"2110723988"},"language":"en","primary_location":{"id":"doi:10.1109/fpl.2007.4380638","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpl.2007.4380638","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 International Conference on Field Programmable Logic and Applications","raw_type":"proceedings-article"},"type":"article","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/A5102278232","display_name":"Shuichi Watanabe","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Shuichi Watanabe","raw_affiliation_strings":["Makuhari Techno Garden B-11F, Kawasaki Microelectronics, Inc., Chiba, Japan","Kawasaki Microelectron. Inc., Chiba"],"affiliations":[{"raw_affiliation_string":"Makuhari Techno Garden B-11F, Kawasaki Microelectronics, Inc., Chiba, Japan","institution_ids":[]},{"raw_affiliation_string":"Kawasaki Microelectron. Inc., Chiba","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031977346","display_name":"Junji Kitamichi","orcid":null},"institutions":[{"id":"https://openalex.org/I141591182","display_name":"University of Aizu","ror":"https://ror.org/02pg0e883","country_code":"JP","type":"education","lineage":["https://openalex.org/I141591182"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Junji Kitamichi","raw_affiliation_strings":["School of Computer Science and Engineering, University of Aizu, Fukushima, Japan","School of Computer Science and Engineering, The University of Aizu, Tsuruga, Ikki-machi, Aizu-Wakamatsu, Fukushima 965-8580, JAPAN. E-mail: kitamiti@u-aizu.ac.jp"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, University of Aizu, Fukushima, Japan","institution_ids":["https://openalex.org/I141591182"]},{"raw_affiliation_string":"School of Computer Science and Engineering, The University of Aizu, Tsuruga, Ikki-machi, Aizu-Wakamatsu, Fukushima 965-8580, JAPAN. E-mail: kitamiti@u-aizu.ac.jp","institution_ids":["https://openalex.org/I141591182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078355400","display_name":"Kenichi Kuroda","orcid":"https://orcid.org/0000-0002-2935-8351"},"institutions":[{"id":"https://openalex.org/I141591182","display_name":"University of Aizu","ror":"https://ror.org/02pg0e883","country_code":"JP","type":"education","lineage":["https://openalex.org/I141591182"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kenichi Kuroda","raw_affiliation_strings":["School of Computer Science and Engineering, University of Aizu, Fukushima, Japan","School of Computer Science and Engineering, The University of Aizu, Tsuruga, Ikki-machi, Aizu-Wakamatsu, Fukushima 965-8580, JAPAN. E-mail: kuroda@u-aizu.ac.jp"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, University of Aizu, Fukushima, Japan","institution_ids":["https://openalex.org/I141591182"]},{"raw_affiliation_string":"School of Computer Science and Engineering, The University of Aizu, Tsuruga, Ikki-machi, Aizu-Wakamatsu, Fukushima 965-8580, JAPAN. E-mail: kuroda@u-aizu.ac.jp","institution_ids":["https://openalex.org/I141591182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102278232"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3736,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65765513,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"389","first_page":"139","last_page":"144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.982699990272522,"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/T11567","display_name":"semigroups and automata theory","score":0.982699990272522,"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.9793000221252441,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9735000133514404,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.7364105582237244},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.7167116403579712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7165691256523132},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6815649271011353},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5862353444099426},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5368881821632385},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4783698618412018},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45669275522232056},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.449253648519516},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3828798234462738},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.18843597173690796},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18583562970161438},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14341309666633606},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09030088782310486},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08609127998352051}],"concepts":[{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.7364105582237244},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7167116403579712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7165691256523132},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6815649271011353},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5862353444099426},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5368881821632385},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4783698618412018},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45669275522232056},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.449253648519516},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3828798234462738},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.18843597173690796},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18583562970161438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14341309666633606},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09030088782310486},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08609127998352051},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/fpl.2007.4380638","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpl.2007.4380638","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 International Conference on Field Programmable Logic and Applications","raw_type":"proceedings-article"},{"id":"mag:2909915958","is_oa":false,"landing_page_url":"https://www.ieice.org/ken/paper/200611308Ao8/eng/","pdf_url":null,"source":{"id":"https://openalex.org/S4306512848","display_name":"IEICE Technical Report; IEICE Tech. Rep.","issn_l":null,"issn":null,"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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEICE Technical Report; IEICE Tech. Rep.","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1487170372","https://openalex.org/W1559959829","https://openalex.org/W2003856929","https://openalex.org/W2010828888","https://openalex.org/W2011039300","https://openalex.org/W2065068924","https://openalex.org/W2096782900","https://openalex.org/W2097169831","https://openalex.org/W2148512362","https://openalex.org/W2476096155","https://openalex.org/W4285719527","https://openalex.org/W6610072603","https://openalex.org/W6674512857"],"related_works":["https://openalex.org/W2110265185","https://openalex.org/W3146360095","https://openalex.org/W2165678151","https://openalex.org/W2082603400","https://openalex.org/W2184011203","https://openalex.org/W1796509207","https://openalex.org/W3203939381","https://openalex.org/W2140498717","https://openalex.org/W2162082186","https://openalex.org/W2005991213"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"describe":[4],"a":[5,25,62,81],"hardware":[6],"algorithm":[7,69,88],"for":[8,55,66,70],"the":[9,67,71,74,86,101,119,125],"minimum":[10],"p-quasi":[11],"clique":[12],"cover":[13],"(MPQCC)":[14],"problem":[15,23,28],"and":[16,100,109,113,135],"its":[17,131],"implementation":[18],"on":[19,90],"an":[20,49],"FPGA.":[21],"MPQCC":[22,43],"is":[24,30,37,122],"combinational":[26],"optimization":[27],"that":[29,118],"NP-complete.":[31],"Furthermore,":[32],"gene":[33,56],"expression":[34,57],"profile":[35,58],"analysis":[36],"one":[38,127],"of":[39,42,73,111],"applied":[40],"fields":[41],"problem.":[44],"We":[45,60,116],"aim":[46],"to":[47,130],"develop":[48],"inexpensive":[50],"acceleration":[51],"system":[52,102],"using":[53,80],"FPGAs":[54,91],"analysis.":[59],"adopt":[61],"Hopfield":[63],"neural":[64],"network":[65,83],"proposed":[68,78,87,120],"reduction":[72],"calculation":[75,137],"time.":[76,138],"The":[77],"architecture":[79],"ring":[82],"can":[84,95,103],"execute":[85],"effectively":[89],"because":[92],"each":[93],"module":[94],"run":[96],"in":[97],"parallel":[98],"independently":[99],"be":[104],"implemented":[105],"with":[106,128],"simple":[107],"placement":[108],"routing":[110],"modules,":[112],"high":[114],"scalability.":[115],"show":[117],"method":[121],"better":[123],"than":[124],"existing":[126],"regard":[129],"solution":[132],"searching":[133],"ability":[134],"required":[136]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}