{"id":"https://openalex.org/W2783170771","doi":"https://doi.org/10.1109/icdim.2017.8244691","title":"Minimum node weight spanning trees searching algorithm for broadcast transmission in sensor networks","display_name":"Minimum node weight spanning trees searching algorithm for broadcast transmission in sensor networks","publication_year":2017,"publication_date":"2017-09-01","ids":{"openalex":"https://openalex.org/W2783170771","doi":"https://doi.org/10.1109/icdim.2017.8244691","mag":"2783170771"},"language":"en","primary_location":{"id":"doi:10.1109/icdim.2017.8244691","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdim.2017.8244691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","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/A5081457779","display_name":"Zbigniew Lipi\u0144ski","orcid":"https://orcid.org/0000-0001-6722-4402"},"institutions":[{"id":"https://openalex.org/I170583851","display_name":"University of Opole","ror":"https://ror.org/04gbpnx96","country_code":"PL","type":"education","lineage":["https://openalex.org/I170583851"]},{"id":"https://openalex.org/I4210137370","display_name":"Institute of Mathematics","ror":"https://ror.org/04hrrh248","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210137370","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Zbigniew Lipinski","raw_affiliation_strings":["Institute of Mathematics and Informatics, Opole University, Opole, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Informatics, Opole University, Opole, Poland","institution_ids":["https://openalex.org/I170583851","https://openalex.org/I4210137370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5081457779"],"corresponding_institution_ids":["https://openalex.org/I170583851","https://openalex.org/I4210137370"],"apc_list":null,"apc_paid":null,"fwci":0.4144,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68296377,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"150","last_page":"154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T11498","display_name":"Security in Wireless Sensor Networks","score":0.9927999973297119,"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/spanning-tree","display_name":"Spanning tree","score":0.856255292892456},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7123779654502869},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.6944629549980164},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5051761269569397},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.5024528503417969},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4976034462451935},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4820195436477661},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48033586144447327},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.4520093500614166},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4485352635383606},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.44583722949028015},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.4411117136478424},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43589285016059875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4244282841682434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41221657395362854},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38778769969940186},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.31727027893066406},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09844768047332764}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.856255292892456},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7123779654502869},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.6944629549980164},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5051761269569397},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.5024528503417969},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4976034462451935},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4820195436477661},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48033586144447327},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.4520093500614166},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4485352635383606},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.44583722949028015},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.4411117136478424},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43589285016059875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4244282841682434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41221657395362854},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38778769969940186},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.31727027893066406},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09844768047332764},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icdim.2017.8244691","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdim.2017.8244691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W170376876","https://openalex.org/W2019932401","https://openalex.org/W2041804895","https://openalex.org/W2062560222","https://openalex.org/W2091062779","https://openalex.org/W2161330625","https://openalex.org/W2167331384","https://openalex.org/W2241733113","https://openalex.org/W2404406427","https://openalex.org/W2611093227","https://openalex.org/W4232896595","https://openalex.org/W4245864785","https://openalex.org/W4297790793","https://openalex.org/W6606936398","https://openalex.org/W6660786957"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2943635264","https://openalex.org/W2376814941","https://openalex.org/W2138987445","https://openalex.org/W2387385213","https://openalex.org/W2589768050","https://openalex.org/W2390742649","https://openalex.org/W3016811403","https://openalex.org/W2069416867","https://openalex.org/W2014932051"],"abstract_inverted_index":{"A":[0],"minimum":[1,91,131],"node":[2,15,92,132],"weight":[3,93,133],"spanning":[4,23,61,94,134],"tree":[5,13],"in":[6,34,43,96],"a":[7,12,48,146],"weighted,":[8],"directed":[9],"graph":[10,50],"is":[11,19,69],"whose":[14],"with":[16],"maximum":[17,39],"out-weight":[18],"minimal":[20],"among":[21],"all":[22],"trees.":[24],"This":[25,121],"type":[26],"of":[27,37,52,104,109,129,141,145],"trees":[28,62,67,95,135],"are":[29,56,119],"important":[30],"because":[31],"they":[32],"appear":[33],"the":[35,38,90,97,100,106,110,125,130,139,143],"solutions":[36],"lifetime":[40],"broadcasting":[41],"problem":[42,137],"wireless":[44],"sensor":[45],"networks.":[46],"In":[47,81,99],"complete":[49],"build":[51],"N":[53,57,148,150],"nodes":[54],"there":[55],"<sup":[58,76],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[59,77],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">N-2</sup>":[60,78],"and":[63],"to":[64,71,123,138],"find":[65],"such":[66],"it":[68],"necessary":[70],"perform":[72],"more":[73],"than":[74],"O(N":[75],")":[79],"operations.":[80],"this":[82],"paper":[83],"we":[84],"propose":[85],"an":[86],"algorithm":[87],"for":[88],"searching":[89,136],"graph.":[98],"proposed":[101],"algorithm,":[102],"instead":[103],"calculating":[105,142],"symbolic":[107],"determinant":[108,144],"generalized":[111],"Laplacian":[112],"matrix,":[113],"numerical":[114],"operations":[115],"on":[116],"its":[117],"exponents":[118],"performed.":[120],"allows":[122],"reduce":[124],"best":[126],"case":[127],"complexity":[128,140],"numeric":[147],"\u00d7":[149],"matrix.":[151]},"counts_by_year":[{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}