{"id":"https://openalex.org/W1640739645","doi":"https://doi.org/10.1109/mmar.2015.7284039","title":"Optimisation of digraphs creation for parallel algorithm for finding a complete set of solutions of characteristic polynomial","display_name":"Optimisation of digraphs creation for parallel algorithm for finding a complete set of solutions of characteristic polynomial","publication_year":2015,"publication_date":"2015-08-01","ids":{"openalex":"https://openalex.org/W1640739645","doi":"https://doi.org/10.1109/mmar.2015.7284039","mag":"1640739645"},"language":"en","primary_location":{"id":"doi:10.1109/mmar.2015.7284039","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmar.2015.7284039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 20th International Conference on Methods and Models in Automation and Robotics (MMAR)","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/A5001426607","display_name":"Krzysztof Hryni\u00f3w","orcid":"https://orcid.org/0000-0001-8044-3925"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Krzysztof Hryniow","raw_affiliation_strings":["Electrical Department, Institute of Control and Industrial Electronics, Warsaw, Poland","Warsaw University of Technology, Electrical Department, Institute of Control and Industrial Electronics, Koszykowa 75, 00-662 Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Electrical Department, Institute of Control and Industrial Electronics, Warsaw, Poland","institution_ids":[]},{"raw_affiliation_string":"Warsaw University of Technology, Electrical Department, Institute of Control and Industrial Electronics, Koszykowa 75, 00-662 Warsaw, Poland","institution_ids":["https://openalex.org/I108403487"]}]},{"author_position":"last","author":{"id":null,"display_name":"Konrad Andrzej Markowski","orcid":null},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Konrad Andrzej Markowski","raw_affiliation_strings":["Electrical Department, Institute of Control and Industrial Electronics, Warsaw, Poland","Warsaw University of Technology, Electrical Department, Institute of Control and Industrial Electronics, Koszykowa 75, 00-662 Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Electrical Department, Institute of Control and Industrial Electronics, Warsaw, Poland","institution_ids":[]},{"raw_affiliation_string":"Warsaw University of Technology, Electrical Department, Institute of Control and Industrial Electronics, Koszykowa 75, 00-662 Warsaw, Poland","institution_ids":["https://openalex.org/I108403487"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001426607"],"corresponding_institution_ids":["https://openalex.org/I108403487"],"apc_list":null,"apc_paid":null,"fwci":4.555,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.94865655,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"35","issue":null,"first_page":"1139","last_page":"1144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9975000023841858,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9936000108718872,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9901000261306763,"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/algorithm","display_name":"Algorithm","score":0.6768838167190552},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5917508602142334},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5897620320320129},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5344011187553406},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5066007375717163},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.49816179275512695},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4712904989719391},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3605380654335022},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19672748446464539}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6768838167190552},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5917508602142334},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5897620320320129},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5344011187553406},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5066007375717163},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.49816179275512695},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4712904989719391},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3605380654335022},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19672748446464539},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mmar.2015.7284039","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmar.2015.7284039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 20th International Conference on Methods and Models in Automation and Robotics (MMAR)","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":21,"referenced_works":["https://openalex.org/W113117168","https://openalex.org/W1006614813","https://openalex.org/W1548164611","https://openalex.org/W1554151144","https://openalex.org/W1565150189","https://openalex.org/W1604304367","https://openalex.org/W1971617292","https://openalex.org/W1996182449","https://openalex.org/W2011529258","https://openalex.org/W2018055788","https://openalex.org/W2084186311","https://openalex.org/W2100038940","https://openalex.org/W2101037112","https://openalex.org/W2116226537","https://openalex.org/W2132330396","https://openalex.org/W2474774282","https://openalex.org/W4285719527","https://openalex.org/W6633231955","https://openalex.org/W6633973196","https://openalex.org/W6677537985","https://openalex.org/W6720788239"],"related_works":["https://openalex.org/W2152992791","https://openalex.org/W2112835755","https://openalex.org/W2349674371","https://openalex.org/W4291951920","https://openalex.org/W2097495471","https://openalex.org/W1696545756","https://openalex.org/W4301867002","https://openalex.org/W2952827811","https://openalex.org/W2385867212","https://openalex.org/W1774334694"],"abstract_inverted_index":{"This":[0],"paper":[1,111],"presents":[2],"a":[3,35,43,57,64,114,117],"series":[4],"of":[5,17,38,45,56,59,65,68,75,83,99,116,119,149],"further":[6],"modifications":[7,98],"to":[8,33,51,63,113],"the":[9,18,23,31,76,78,100,131,140],"parallel":[10,79],"algorithm":[11,25,80,101,132],"used":[12],"for":[13,86],"finding":[14,84],"digraphs":[15],"realisations":[16],"characteristic":[19],"polynomial.":[20],"What":[21],"distinguishes":[22],"mentioned":[24],"from":[26],"other":[27],"state-of-the-art":[28],"solutions":[29,48,69,85,121],"is":[30,81],"ability":[32],"find":[34],"complete":[36],"set":[37],"existing":[39],"solutions,":[40],"not":[41],"just":[42],"few":[44],"them.":[46],"Moreover,":[47],"found":[49],"tend":[50],"be":[52],"minimal":[53],"in":[54,90,109,136],"terms":[55],"rank":[58],"matrices":[60],"created.":[61],"Due":[62],"large":[66],"number":[67,118],"tested":[70,127],"and":[71,105,125,128],"an":[72,147],"NP-hard":[73],"complexity":[74],"problem,":[77],"incapable":[82],"more":[87],"complicated":[88],"problems":[89],"reasonable":[91],"time.":[92],"To":[93],"address":[94],"this":[95,110],"problem":[96],"additional":[97],"structure":[102],"are":[103,123],"proposed":[104],"explained.":[106],"Modifications":[107],"presented":[108],"contribute":[112],"reduction":[115],"improper":[120],"that":[122],"created,":[124],"later":[126],"rejected,":[129],"by":[130,146],"making":[133],"it":[134],"work":[135],"all":[137],"cases,":[138],"except":[139],"most":[141],"trivial":[142],"ones,":[143],"at":[144],"least":[145],"order":[148],"magnitude":[150],"faster.":[151]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}