{"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":"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/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":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2145,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58647858,"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,24,39,53,73,83],"a":[4,14,57,101,110],"spanning":[5],"sub-graph":[6],"H(V,":[7],"E":[8],"<sup":[9],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[10],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">'</sup>":[11],")":[12],"of":[13,44,50,78],"graph":[15,52],"G(V,":[16],"E)":[17],"such":[18],"that":[19,75,90],"where":[20],"distance(u,":[21],"v,":[22],"G)":[23],"the":[25,29,41,45,48,51,59,63,67,76,113],"shortest":[26,60],"distance":[27,61],"between":[28,62],"vertices":[30,64],"u":[31],"and":[32],"v":[33],"in":[34],"G.":[35],"The":[36],"parameter":[37],"t":[38],"called":[40],"multiplicative":[42,107],"stretch":[43,68,114],"spanner.":[46],"When":[47],"size":[49],"reduced":[54],"to":[55,105],"construct":[56,106],"spanner,":[58],"increases,":[65],"consequently":[66],"factor":[69],"also":[70],"increases.":[71],"It":[72],"known":[74],"construction":[77],"spanners":[79],"with":[80,109],"optimum":[81],"size-stretch":[82],"hard.":[84],"Many":[85],"researchers":[86],"proposed":[87],"efficient":[88],"algorithms":[89],"yield":[91],"proven":[92],"near":[93],"optimal":[94],"results.":[95],"In":[96],"this":[97],"paper":[98],"we":[99],"propose":[100],"quadratic":[102],"time":[103],"algorithm":[104],"t-spanners":[108],"bound":[111],"on":[112],"factor.":[115]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}