{"id":"https://openalex.org/W3033217487","doi":"https://doi.org/10.26637/mjm0s20/0110","title":"An $O(n)$-time algorithm to compute minimum $k$-hop connected dominating set of interval graphs","display_name":"An $O(n)$-time algorithm to compute minimum $k$-hop connected dominating set of interval graphs","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3033217487","doi":"https://doi.org/10.26637/mjm0s20/0110","mag":"3033217487"},"language":"en","primary_location":{"id":"doi:10.26637/mjm0s20/0110","doi":"https://doi.org/10.26637/mjm0s20/0110","is_oa":true,"landing_page_url":"https://doi.org/10.26637/mjm0s20/0110","pdf_url":null,"source":{"id":"https://openalex.org/S4210187168","display_name":"Malaya Journal of Matematik","issn_l":"2319-3786","issn":["2319-3786","2321-5666"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Malaya Journal of Matematik","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.26637/mjm0s20/0110","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058160355","display_name":"Sambhu Charan Barman","orcid":"https://orcid.org/0000-0002-6662-5172","observed_orcids":["https://orcid.org/0000-0002-6662-5172"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sambhu Charan Barman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039205000","display_name":"Madhumangal Pal","orcid":"https://orcid.org/0000-0002-6709-836X","observed_orcids":["https://orcid.org/0000-0002-6709-836X","https://orcid.org/0000-0002-7131-7131"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Madhumangal Pal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087598067","display_name":"Sukumar Mondal","orcid":"https://orcid.org/0000-0002-5639-8439","observed_orcids":["https://orcid.org/0000-0002-5639-8439"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sukumar Mondal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"S","issue":"1","first_page":"576","last_page":"580"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5356000065803528,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5356000065803528,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.4580000042915344,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.0035000001080334187,"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/interval-graphs","display_name":"interval graphs","score":0.9750000238418579},{"id":"https://openalex.org/keywords/linear-time-algorithms","display_name":"linear-time algorithms","score":0.8560000061988831},{"id":"https://openalex.org/keywords/connected-domination","display_name":"connected domination","score":0.47699999809265137},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.4909999966621399}],"concepts":[{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.6906313896179199},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.6736863851547241},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5861726403236389},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5043419599533081},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4967239499092102},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.49057310819625854},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.455089807510376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45388302206993103},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4483347535133362},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4421975016593933},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.43667224049568176},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42154717445373535},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3405434489250183},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.24123218655586243},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16231340169906616},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.26637/mjm0s20/0110","doi":"https://doi.org/10.26637/mjm0s20/0110","is_oa":true,"landing_page_url":"https://doi.org/10.26637/mjm0s20/0110","pdf_url":null,"source":{"id":"https://openalex.org/S4210187168","display_name":"Malaya Journal of Matematik","issn_l":"2319-3786","issn":["2319-3786","2321-5666"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Malaya Journal of Matematik","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.26637/mjm0s20/0110","doi":"https://doi.org/10.26637/mjm0s20/0110","is_oa":true,"landing_page_url":"https://doi.org/10.26637/mjm0s20/0110","pdf_url":null,"source":{"id":"https://openalex.org/S4210187168","display_name":"Malaya Journal of Matematik","issn_l":"2319-3786","issn":["2319-3786","2321-5666"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Malaya Journal of Matematik","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2904438600","https://openalex.org/W1557123896","https://openalex.org/W1582194001","https://openalex.org/W4296167894","https://openalex.org/W2390213168","https://openalex.org/W2021430268","https://openalex.org/W1444318869","https://openalex.org/W3007527189","https://openalex.org/W2791998335","https://openalex.org/W2078732465"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-09-25T08:18:29.962427","created_date":"2020-06-12T00:00:00"}