{"id":"https://openalex.org/W2902692154","doi":"https://doi.org/10.1109/icacci.2018.8554779","title":"Construction of Multiplicative Graph Spanners using Minimum Connected Dominating Set with Bounded Diameter","display_name":"Construction of Multiplicative Graph Spanners using Minimum Connected Dominating Set with Bounded Diameter","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2902692154","doi":"https://doi.org/10.1109/icacci.2018.8554779","mag":"2902692154"},"language":"en","primary_location":{"id":"doi:10.1109/icacci.2018.8554779","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2018.8554779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5080376810","display_name":"Praneeth Tatikonda","orcid":null},"institutions":[{"id":"https://openalex.org/I81556334","display_name":"Amrita Vishwa Vidyapeetham","ror":"https://ror.org/03am10p12","country_code":"IN","type":"education","lineage":["https://openalex.org/I81556334"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Praneeth Tatikonda","raw_affiliation_strings":["Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, India","institution_ids":["https://openalex.org/I81556334"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010975712","display_name":"Harsha Kuppili","orcid":null},"institutions":[{"id":"https://openalex.org/I81556334","display_name":"Amrita Vishwa Vidyapeetham","ror":"https://ror.org/03am10p12","country_code":"IN","type":"education","lineage":["https://openalex.org/I81556334"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Harsha Kuppili","raw_affiliation_strings":["Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, India","institution_ids":["https://openalex.org/I81556334"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032809114","display_name":"Avinash Paila","orcid":null},"institutions":[{"id":"https://openalex.org/I81556334","display_name":"Amrita Vishwa Vidyapeetham","ror":"https://ror.org/03am10p12","country_code":"IN","type":"education","lineage":["https://openalex.org/I81556334"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Avinash Paila","raw_affiliation_strings":["Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, India","institution_ids":["https://openalex.org/I81556334"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102995399","display_name":"P. Jayakumar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jayakumar Pail","raw_affiliation_strings":["Department of Computer Science and Applications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Applications","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041549614","display_name":"Jyothisha J. Nair","orcid":"https://orcid.org/0000-0002-8050-8896"},"institutions":[{"id":"https://openalex.org/I81556334","display_name":"Amrita Vishwa Vidyapeetham","ror":"https://ror.org/03am10p12","country_code":"IN","type":"education","lineage":["https://openalex.org/I81556334"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jyothisha J. Nair","raw_affiliation_strings":["Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, India","institution_ids":["https://openalex.org/I81556334"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3176,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52158736,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"20","issue":null,"first_page":"1436","last_page":"1440"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9984999895095825,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/spanner","display_name":"Spanner","score":0.9493575096130371},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.8790344595909119},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7808298468589783},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6065555810928345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5850247144699097},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5301692485809326},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44523435831069946},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.44195640087127686},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43837568163871765},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24901452660560608},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.059047043323516846}],"concepts":[{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.9493575096130371},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.8790344595909119},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7808298468589783},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6065555810928345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5850247144699097},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5301692485809326},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44523435831069946},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.44195640087127686},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43837568163871765},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24901452660560608},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.059047043323516846},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icacci.2018.8554779","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2018.8554779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1997010704","https://openalex.org/W1997973101","https://openalex.org/W2002041206","https://openalex.org/W2063722406","https://openalex.org/W2092534058","https://openalex.org/W2098502330","https://openalex.org/W2099237198","https://openalex.org/W2119499630","https://openalex.org/W2154507010","https://openalex.org/W4245082111","https://openalex.org/W7026591645"],"related_works":["https://openalex.org/W2949889395","https://openalex.org/W4297623464","https://openalex.org/W2162831161","https://openalex.org/W2126497992","https://openalex.org/W2082551413","https://openalex.org/W3197005352","https://openalex.org/W2079518702","https://openalex.org/W3127121181","https://openalex.org/W2114946841","https://openalex.org/W2902692154"],"abstract_inverted_index":{"A":[0],"Multiplicative":[1],"Spanner":[2],"is":[3,20,35,49,69,79],"a":[4,10,53,97,106],"spanning":[5],"sub-graph":[6],"H(V,":[7],"E')":[8],"of":[9,40,46,74],"graph":[11,48],"G(V,":[12],"E)":[13],"such":[14],"that":[15,71,86],"where":[16],"distance(u,":[17],"v,":[18],"G)":[19],"the":[21,25,37,41,44,47,55,59,63,72,109],"shortest":[22,56],"distance":[23,57],"between":[24,58],"vertices":[26,60],"u":[27],"and":[28],"v":[29],"in":[30],"G.":[31],"The":[32],"parameter":[33],"t":[34],"called":[36],"multiplicative":[38,103],"stretch":[39,64,110],"spanner.":[42],"When":[43],"size":[45],"reduced":[50],"to":[51,101],"construct":[52,102],"spanner,":[54],"increases,":[61],"consequently":[62],"factor":[65],"also":[66],"increases.":[67],"It":[68],"known":[70],"construction":[73],"spanners":[75],"with":[76,105],"optimum":[77],"size-stretch":[78],"hard.":[80],"Many":[81],"researchers":[82],"proposed":[83],"efficient":[84],"algorithms":[85],"yield":[87],"proven":[88],"near":[89],"optimal":[90],"results.":[91],"In":[92],"this":[93],"paper":[94],"we":[95],"propose":[96],"quadratic":[98],"time":[99],"algorithm":[100],"t-spanners":[104],"bound":[107],"on":[108],"factor.":[111]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}