{"id":"https://openalex.org/W2095423548","doi":"https://doi.org/10.1142/s1793830915500202","title":"A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs","display_name":"A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs","publication_year":2015,"publication_date":"2015-03-25","ids":{"openalex":"https://openalex.org/W2095423548","doi":"https://doi.org/10.1142/s1793830915500202","mag":"2095423548"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830915500202","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830915500202","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/A5061095539","display_name":"B. S. Panda","orcid":"https://orcid.org/0000-0002-0721-5325"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"B. S. Panda","raw_affiliation_strings":["Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology, Delhi, Hauz Khas, New Delhi 110 016, India","Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110 016, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology, Delhi, Hauz Khas, New Delhi 110 016, India","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110 016, India#TAB#","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025849953","display_name":"D. Pradhan","orcid":"https://orcid.org/0000-0003-4100-4414"},"institutions":[{"id":"https://openalex.org/I189109744","display_name":"Indian Institute of Technology Dhanbad","ror":"https://ror.org/013v3cc28","country_code":"IN","type":"education","lineage":["https://openalex.org/I189109744"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"D. Pradhan","raw_affiliation_strings":["Department of Applied Mathematics, Indian School of Mines, Dhanbad, India","Department of Applied Mathematics, Indian School of Mines, Dhanbad, India;"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Indian School of Mines, Dhanbad, India","institution_ids":["https://openalex.org/I189109744"]},{"raw_affiliation_string":"Department of Applied Mathematics, Indian School of Mines, Dhanbad, India;","institution_ids":["https://openalex.org/I189109744"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061095539"],"corresponding_institution_ids":["https://openalex.org/I68891433"],"apc_list":null,"apc_paid":null,"fwci":1.0515,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78917886,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"07","issue":"02","first_page":"1550020","last_page":"1550020"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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":0.9997000098228455,"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.9943000078201294,"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.9886999726295471,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.8101577758789062},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7926602363586426},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.7201130390167236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7090706825256348},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.6782442927360535},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.6759854555130005},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5740485191345215},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.536432683467865},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5363183617591858},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5115869641304016},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.50627601146698},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4664105176925659},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.42043066024780273},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34389883279800415},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.21632713079452515},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12648531794548035}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.8101577758789062},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7926602363586426},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7201130390167236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7090706825256348},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.6782442927360535},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6759854555130005},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5740485191345215},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.536432683467865},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5363183617591858},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5115869641304016},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.50627601146698},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4664105176925659},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.42043066024780273},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34389883279800415},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.21632713079452515},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12648531794548035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830915500202","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830915500202","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":20,"referenced_works":["https://openalex.org/W123065172","https://openalex.org/W1579049696","https://openalex.org/W1982805968","https://openalex.org/W1997940755","https://openalex.org/W2009525588","https://openalex.org/W2011039300","https://openalex.org/W2015470569","https://openalex.org/W2015983146","https://openalex.org/W2029336174","https://openalex.org/W2031319443","https://openalex.org/W2039024583","https://openalex.org/W2048144137","https://openalex.org/W2048655992","https://openalex.org/W2058460385","https://openalex.org/W2067264828","https://openalex.org/W2073279057","https://openalex.org/W2075840509","https://openalex.org/W2084981300","https://openalex.org/W2089465933","https://openalex.org/W2103411036"],"related_works":["https://openalex.org/W2788975631","https://openalex.org/W2963009577","https://openalex.org/W2903402681","https://openalex.org/W2117608641","https://openalex.org/W2910018628","https://openalex.org/W1681620790","https://openalex.org/W4298846841","https://openalex.org/W2952658105","https://openalex.org/W645031676","https://openalex.org/W4283803822"],"abstract_inverted_index":{"A":[0],"set":[1,9,56,90],"D":[2,28],"\u2286":[3],"V":[4],"is":[5,22,47,66],"a":[6,11,25,30,35,39,53,80,86,92,98],"restrained":[7,44,54,63,88,108],"dominating":[8,55,89],"of":[10,57,91,106],"graph":[12,36],"G":[13,37,51],"=":[14],"(V,":[15],"E)":[16],"if":[17],"every":[18],"vertex":[19,26,31],"in":[20,27,32],"V\\D":[21],"adjacent":[23],"to":[24,48,68,84],"and":[29,38,120],"V\\D.":[33],"Given":[34],"positive":[40],"integer":[41],"k,":[42],"the":[43,104,107],"domination":[45,64,109],"problem":[46,65,110],"check":[49],"whether":[50],"has":[52],"size":[58],"at":[59],"most":[60],"k.":[61],"The":[62],"known":[67],"be":[69],"NP-complete":[70],"even":[71],"for":[72,111],"chordal":[73,115],"graphs.":[74,122],"In":[75],"this":[76],"paper,":[77],"we":[78],"propose":[79],"linear":[81],"time":[82,100],"algorithm":[83],"compute":[85],"minimum":[87],"proper":[93],"interval":[94],"graph.":[95],"We":[96],"present":[97],"polynomial":[99],"reduction":[101],"that":[102],"proves":[103],"NP-completeness":[105],"undirected":[112],"path":[113],"graphs,":[114,117,119],"bipartite":[116],"circle":[118],"planar":[121]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}