{"id":"https://openalex.org/W2983527869","doi":"https://doi.org/10.1142/s1793830920500111","title":"A linear algorithm for double Roman domination of proper interval graphs","display_name":"A linear algorithm for double Roman domination of proper interval graphs","publication_year":2019,"publication_date":"2019-11-13","ids":{"openalex":"https://openalex.org/W2983527869","doi":"https://doi.org/10.1142/s1793830920500111","mag":"2983527869"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830920500111","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830920500111","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","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/A5085912207","display_name":"Abolfazl Poureidi","orcid":"https://orcid.org/0000-0002-2506-0590"},"institutions":[{"id":"https://openalex.org/I176861719","display_name":"University of Shahrood","ror":"https://ror.org/00yqvtm78","country_code":"IR","type":"education","lineage":["https://openalex.org/I176861719"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Abolfazl Poureidi","raw_affiliation_strings":["Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran"],"raw_orcid":"https://orcid.org/0000-0002-2506-0590","affiliations":[{"raw_affiliation_string":"Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran","institution_ids":["https://openalex.org/I176861719"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085912207"],"corresponding_institution_ids":["https://openalex.org/I176861719"],"apc_list":null,"apc_paid":null,"fwci":0.7999,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76274691,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"01","first_page":"2050011","last_page":"2050011"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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.9975000023841858,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7423578500747681},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7079691290855408},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6338720321655273},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4403987526893616},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32228514552116394}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7423578500747681},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7079691290855408},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6338720321655273},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4403987526893616},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32228514552116394}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830920500111","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830920500111","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1493071618","https://openalex.org/W2026300475","https://openalex.org/W2058946695","https://openalex.org/W2095423548","https://openalex.org/W2346913169","https://openalex.org/W2744781146","https://openalex.org/W2790637388","https://openalex.org/W2796426100","https://openalex.org/W2883391582","https://openalex.org/W2963116939","https://openalex.org/W4251005761"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2962838298","https://openalex.org/W3111310291"],"abstract_inverted_index":{"A":[0],"function":[1,10,81,103],"[Formula:":[2,14,21,25,33,37,45,49,56,60,67,71,82,86,92,105,116,139,143],"see":[3,15,22,26,34,38,46,50,57,61,68,72,83,87,93,106,117,140,144],"text]":[4,16,23,27,35,39,47,51,58,62,69,84,88,107,141,145],"is":[5,30,64,89,108],"a":[6,12,31,65,77,99,134],"double":[7,78,100,111,129],"Roman":[8,79,101,112,130],"dominating":[9,80,102],"on":[11,85,104],"graph":[13,138],"if":[17],"for":[18,53],"every":[19,54],"vertex":[20,32,55,66],"with":[24,36,48,59,70],"either":[28],"there":[29,41,63],"or":[40],"are":[42],"distinct":[43],"vertices":[44],"and":[52],"text].":[73,94,118],"The":[74,95],"weight":[75,97],"of":[76,98,115,133],"the":[90,110,128],"value":[91],"minimum":[96],"called":[109],"domination":[113,131],"number":[114,132],"In":[119],"this":[120],"paper,":[121],"we":[122],"give":[123],"an":[124],"algorithm":[125],"to":[126],"compute":[127],"given":[135],"proper":[136],"interval":[137],"in":[142],"time.":[146]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}