{"id":"https://openalex.org/W4310154885","doi":"https://doi.org/10.3390/a15120448","title":"A Multi-Dimensional Matrix Product\u2014A Natural Tool for Parameterized Graph Algorithms","display_name":"A Multi-Dimensional Matrix Product\u2014A Natural Tool for Parameterized Graph Algorithms","publication_year":2022,"publication_date":"2022-11-28","ids":{"openalex":"https://openalex.org/W4310154885","doi":"https://doi.org/10.3390/a15120448"},"language":"en","primary_location":{"id":"doi:10.3390/a15120448","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15120448","pdf_url":"https://www.mdpi.com/1999-4893/15/12/448/pdf?version=1670300598","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/12/448/pdf?version=1670300598","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055131210","display_name":"Miros\u0142aw Kowaluk","orcid":"https://orcid.org/0000-0002-1805-5654"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Miros\u0142aw Kowaluk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, 00-927 Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, 00-927 Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Andrzej Lingas","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 22100 Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 22100 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016509031"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.2013,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.48798897,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":"12","first_page":"448","last_page":"448"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9973999857902527,"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.9969000220298767,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7468810677528381},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.7326878309249878},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.533939778804779},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.5220099091529846},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5170653462409973},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5136353373527527},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5119792222976685},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47092241048812866},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.4706377685070038},{"id":"https://openalex.org/keywords/logical-matrix","display_name":"Logical matrix","score":0.4630672037601471},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4339365065097809},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4333612620830536},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4107195734977722},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.388374924659729}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7468810677528381},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.7326878309249878},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.533939778804779},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.5220099091529846},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5170653462409973},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5136353373527527},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5119792222976685},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47092241048812866},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.4706377685070038},{"id":"https://openalex.org/C163561899","wikidata":"https://www.wikidata.org/wiki/Q1994977","display_name":"Logical matrix","level":3,"score":0.4630672037601471},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4339365065097809},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4333612620830536},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4107195734977722},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.388374924659729},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a15120448","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15120448","pdf_url":"https://www.mdpi.com/1999-4893/15/12/448/pdf?version=1670300598","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:d7d657ce06b44a9381257953a5cb7160","is_oa":true,"landing_page_url":"https://doaj.org/article/d7d657ce06b44a9381257953a5cb7160","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 12, p 448 (2022)","raw_type":"article"},{"id":"pmh:oai:lup.lub.lu.se:80cce3c8-1ece-489f-b2c0-eeb6602c3989","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/80cce3c8-1ece-489f-b2c0-eeb6602c3989","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1999-4893","raw_type":"text"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/12/448/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15120448","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 12; Pages: 448","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15120448","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15120448","pdf_url":"https://www.mdpi.com/1999-4893/15/12/448/pdf?version=1670300598","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4310154885.pdf","grobid_xml":"https://content.openalex.org/works/W4310154885.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W104109059","https://openalex.org/W1489509891","https://openalex.org/W1536957917","https://openalex.org/W1561486811","https://openalex.org/W1601568173","https://openalex.org/W1760533781","https://openalex.org/W1883038075","https://openalex.org/W1963838724","https://openalex.org/W1973113631","https://openalex.org/W1989682699","https://openalex.org/W1991858502","https://openalex.org/W2004116976","https://openalex.org/W2011999472","https://openalex.org/W2020346765","https://openalex.org/W2035476608","https://openalex.org/W2049500052","https://openalex.org/W2070188445","https://openalex.org/W2096111774","https://openalex.org/W2102039892","https://openalex.org/W2110053161","https://openalex.org/W2114047496","https://openalex.org/W2115179770","https://openalex.org/W2120291315","https://openalex.org/W2130190334","https://openalex.org/W2137120608","https://openalex.org/W2150875823","https://openalex.org/W2162118804","https://openalex.org/W2569195351","https://openalex.org/W2962817833","https://openalex.org/W2963464974","https://openalex.org/W3116253690","https://openalex.org/W3137337592","https://openalex.org/W4247746673","https://openalex.org/W4256418102","https://openalex.org/W4292230561","https://openalex.org/W6603887729"],"related_works":["https://openalex.org/W2996901643","https://openalex.org/W1546001247","https://openalex.org/W4298032395","https://openalex.org/W2791396693","https://openalex.org/W1577432610","https://openalex.org/W4250699059","https://openalex.org/W2170614016","https://openalex.org/W4312934552","https://openalex.org/W2141293105","https://openalex.org/W2133579811"],"abstract_inverted_index":{"We":[0,24,143],"introduce":[1],"the":[2,29,34,47,51,56,71,83,88,125,132,158,170,186,191,197,201,205,217,221,236,242,246,251,255,259,266,269,280,283],"concept":[3],"of":[4,10,14,32,40,46,50,55,59,73,91,94,149,152,175,185,200,203,216,219,228,238,241,245,254,265,271,282],"a":[5,95,100,138,231],"k-dimensional":[6,206],"matrix":[7,61,65,85,160,193,208,248,285],"product":[8,35,52,66,86,286],"D":[9],"k":[11],"matrices":[12],"A1,\u2026,Ak":[13],"sizes":[15],"n1\u00d7n,\u2026,nk\u00d7n,":[16],"respectively,":[17],"where":[18],"D[i1,\u2026,ik]":[19],"is":[20,68,163,274],"equal":[21],"to":[22,87,140,190,235],"\u2211\u2113=1nA1[i1,\u2113]\u00d7\u2026\u00d7Ak[ik,\u2113].":[23],"provide":[25,144,212],"upper":[26],"bounds":[27],"on":[28,82,106,137,157],"time":[30,57,167,252],"complexity":[31,58],"computing":[33,41,204],"and":[36,43,177],"solving":[37],"related":[38],"problems":[39],"witnesses":[42,45,240],"maximum":[44],"Boolean":[48,207,243],"version":[49],"in":[53,70,99,124,173,230],"terms":[54],"rectangular":[60],"multiplication.":[62],"The":[63,103,128],"multi-dimensional":[64,84,159,192,247,284],"framework":[67],"useful":[69],"design":[72],"parameterized":[74],"graph":[75,98,234],"algorithms.":[76],"First,":[77],"we":[78,180,211],"apply":[79],"our":[80,272],"results":[81],"fundamental":[89],"problem":[90,108,189,202,218,237],"detecting/counting":[92],"copies":[93,151],"fixed":[96,153],"pattern":[97,113,122],"host":[101],"graph.":[102],"recent":[104],"progress":[105],"this":[107],"has":[109],"not":[110],"included":[111],"complete":[112],"graphs,":[114,123],"i.e.,":[115,120],"cliques":[116,155],"(and":[117],"their":[118],"complements,":[119],"edge-free":[121],"induced":[126],"setting).":[127],"fastest":[129],"algorithms":[130,256,273,277],"for":[131,225],"aforementioned":[133,260],"patterns":[134],"are":[135],"based":[136,156],"reduction":[139,184,215],"triangle":[141,171],"detection/counting.":[142],"an":[145,182,213],"alternative":[146],"simple":[147],"method":[148,172],"detection/counting":[150],"size":[154],"product.":[161,194,209,249],"It":[162,195],"at":[164],"least":[165],"as":[166,169],"efficient":[168,214],"cases":[174],"K4":[176],"K5.":[178],"Next,":[179],"show":[181],"immediate":[183],"k-dominating":[187],"set":[188],"implies":[196],"W[2]":[198],"hardness":[199],"Finally,":[210],"finding":[220,239],"lowest":[222],"common":[223],"ancestors":[224],"all":[226],"k-tuples":[227],"vertices":[229],"directed":[232],"acyclic":[233],"variant":[244],"Although":[250],"complexities":[253],"resulting":[257],"from":[258],"reductions":[261],"solely":[262],"match":[263],"those":[264],"known":[267],"algorithms,":[268],"advantage":[270],"simplicity.":[275],"Our":[276],"also":[278],"demonstrate":[279],"versatility":[281],"framework.":[287]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}