{"id":"https://openalex.org/W4400693333","doi":"https://doi.org/10.1142/s0129054124500151","title":"An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs","display_name":"An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs","publication_year":2024,"publication_date":"2024-07-12","ids":{"openalex":"https://openalex.org/W4400693333","doi":"https://doi.org/10.1142/s0129054124500151"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054124500151","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054124500151","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-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/A5111285213","display_name":"Mahin Bahrami","orcid":null},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mahin Bahrami","raw_affiliation_strings":["Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Iran","institution_ids":["https://openalex.org/I158248296"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028240102","display_name":"Dariush Kiani","orcid":"https://orcid.org/0000-0003-4574-4380"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Dariush Kiani","raw_affiliation_strings":["Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Iran"],"raw_orcid":"https://orcid.org/0000-0003-4574-4380","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Iran","institution_ids":["https://openalex.org/I158248296"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063626517","display_name":"Zahed Rahmati","orcid":"https://orcid.org/0000-0002-6942-3453"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Zahed Rahmati","raw_affiliation_strings":["Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Iran","institution_ids":["https://openalex.org/I158248296"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111285213"],"corresponding_institution_ids":["https://openalex.org/I158248296"],"apc_list":null,"apc_paid":null,"fwci":0.3457,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60863756,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"36","issue":"04","first_page":"501","last_page":"516"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9944000244140625,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9944000244140625,"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.9937000274658203,"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/T12029","display_name":"DNA and Biological Computing","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6487608551979065},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5454126596450806},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49767401814460754},{"id":"https://openalex.org/keywords/dot-product","display_name":"Dot product","score":0.4690435528755188},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44456642866134644},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4307302236557007},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.4301181435585022},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40395164489746094},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36423566937446594},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.31061679124832153},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.28365159034729004},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11089092493057251},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.061439722776412964}],"concepts":[{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6487608551979065},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5454126596450806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49767401814460754},{"id":"https://openalex.org/C32900221","wikidata":"https://www.wikidata.org/wiki/Q181365","display_name":"Dot product","level":2,"score":0.4690435528755188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44456642866134644},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4307302236557007},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.4301181435585022},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40395164489746094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36423566937446594},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.31061679124832153},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28365159034729004},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11089092493057251},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.061439722776412964}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054124500151","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054124500151","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4300000071525574,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1848620603","https://openalex.org/W1971048994","https://openalex.org/W1978219425","https://openalex.org/W1985061429","https://openalex.org/W1990495065","https://openalex.org/W2049605303","https://openalex.org/W2066459332","https://openalex.org/W2070497706","https://openalex.org/W2093308813","https://openalex.org/W2115124828","https://openalex.org/W2154454189","https://openalex.org/W4244426546"],"related_works":["https://openalex.org/W4300075580","https://openalex.org/W2952648278","https://openalex.org/W2258906315","https://openalex.org/W2951874707","https://openalex.org/W4296024824","https://openalex.org/W2312623659","https://openalex.org/W4234401186","https://openalex.org/W2001019475","https://openalex.org/W2100609334","https://openalex.org/W4300852132"],"abstract_inverted_index":{"A":[0],"graph":[1,12,101],"[Formula:":[2,8,18,28,32,35,42,48,53,58,69,73],"see":[3,9,19,29,33,36,43,49,54,59,70,74],"text]":[4,20,30,37,50,55,71],"is":[5,15,56,63,128],"called":[6,64],"a":[7,16,57],"text]-dot":[10,60],"product":[11,61,67,88],"if":[13,38,41,111],"there":[14],"function":[17],"such":[21,51],"that":[22,52],"for":[23,84],"any":[24],"two":[25,96,103],"distinct":[26],"vertices":[27],"and":[31,39,120],"text],":[34],"only":[40,106],"text].":[44,75],"The":[45],"minimum":[46],"value":[47],"graph,":[62],"the":[65,86,100,121,126],"dot":[66,87],"dimension":[68,89],"of":[72,90,93,123,125],"In":[76],"this":[77],"paper,":[78],"we":[79,105],"give":[80],"an":[81],"efficient":[82],"algorithm":[83],"computing":[85],"outerplanar":[91,109],"graphs":[92,110],"at":[94],"most":[95],"edge-disjoint":[97],"cycles.":[98],"If":[99],"has":[102],"cycles,":[104],"consider":[107],"those":[108],"both":[112],"cycles":[113,127],"have":[114],"exactly":[115],"one":[116,124],"vertex":[117],"in":[118],"common":[119],"length":[122],"greater":[129],"than":[130],"or":[131],"equal":[132],"to":[133],"six.":[134]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-02-08T09:19:03.324500","created_date":"2025-10-10T00:00:00"}