FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2155704505> ?p ?o ?g. }

• W2155704505 abstract "Broadcasting algorithms have a various range of applications in different fields of computer science. In this paper we analyze the number of message transmissions generated by efficient randomized broadcasting algorithms in random-like networks. We mainly consider the classical random graph model, i.e., a graph Gp with n nodes in which any two arbitrary nodes are connected with probability p, independently. For these graphs, we present an efficient broadcasting algorithm based on the random phone call model introduced by Karp et al. [21], and show that the total number of message transmissions generated by this algorithm is bounded by an asymptotically optimal value in almost all connected random graphs. More precisely, we show that if p ≥ logδn/n for some constant δ > 2, then we are able to broadcast any information r in a random graph Gp of size n in O(log n) steps by using at most O(n max{log log n, log n/ log d}) transmissions related to r, where d = pn denotes the expected average degree in Gp. We also show that for these kind of graphs there is a a matching lower bound on the number of transmissions generated by any efficient broadcasting algorithm which works within the limits of the random phone call model. Please note that the main result holds with probability 1-1/nΩ(1), even if n and d are unknown to the nodes of the graph.The algorithm we present in this paper is based on a simple communication model [21], is scalable, and robust. It can efficiently handle restricted communication failures and certain changes in the size of the network, and can also be extended to certain types of truncated power law graphs based on the models of [1, 2, 5]. In addition, our methods and results might be useful for further research on this field." @default.
• W2155704505 created "2016-06-24" @default.
• W2155704505 creator A5061445188 @default.
• W2155704505 date "2006-07-30" @default.
• W2155704505 modified "2023-10-02" @default.
• W2155704505 title "On the communication complexity of randomized broadcasting in random-like graphs" @default.
• W2155704505 cites W1530129411 @default.
• W2155704505 cites W1973836644 @default.
• W2155704505 cites W1975950716 @default.
• W2155704505 cites W1984977694 @default.
• W2155704505 cites W2030235801 @default.
• W2155704505 cites W2038562061 @default.
• W2155704505 cites W2042587503 @default.
• W2155704505 cites W2047784567 @default.
• W2155704505 cites W2056496732 @default.
• W2155704505 cites W2057399436 @default.
• W2155704505 cites W2068902429 @default.
• W2155704505 cites W2082137560 @default.
• W2155704505 cites W2112976607 @default.
• W2155704505 cites W2123637506 @default.
• W2155704505 cites W2148606196 @default.
• W2155704505 cites W2152361742 @default.
• W2155704505 cites W2997134027 @default.
• W2155704505 cites W4252973173 @default.
• W2155704505 cites W4312512934 @default.
• W2155704505 doi "https://doi.org/10.1145/1148109.1148135" @default.
• W2155704505 hasPublicationYear "2006" @default.
• W2155704505 type Work @default.
• W2155704505 sameAs 2155704505 @default.
• W2155704505 citedByCount "45" @default.
• W2155704505 countsByYear W21557045052012 @default.
• W2155704505 countsByYear W21557045052013 @default.
• W2155704505 countsByYear W21557045052014 @default.
• W2155704505 countsByYear W21557045052015 @default.
• W2155704505 countsByYear W21557045052016 @default.
• W2155704505 countsByYear W21557045052017 @default.
• W2155704505 countsByYear W21557045052018 @default.
• W2155704505 crossrefType "proceedings-article" @default.
• W2155704505 hasAuthorship W2155704505A5061445188 @default.
• W2155704505 hasConcept C110157686 @default.
• W2155704505 hasConcept C11413529 @default.
• W2155704505 hasConcept C128669082 @default.
• W2155704505 hasConcept C132525143 @default.
• W2155704505 hasConcept C31258907 @default.
• W2155704505 hasConcept C41008148 @default.
• W2155704505 hasConcept C47458327 @default.
• W2155704505 hasConcept C80444323 @default.
• W2155704505 hasConceptScore W2155704505C110157686 @default.
• W2155704505 hasConceptScore W2155704505C11413529 @default.
• W2155704505 hasConceptScore W2155704505C128669082 @default.
• W2155704505 hasConceptScore W2155704505C132525143 @default.
• W2155704505 hasConceptScore W2155704505C31258907 @default.
• W2155704505 hasConceptScore W2155704505C41008148 @default.
• W2155704505 hasConceptScore W2155704505C47458327 @default.
• W2155704505 hasConceptScore W2155704505C80444323 @default.
• W2155704505 hasLocation W21557045051 @default.
• W2155704505 hasOpenAccess W2155704505 @default.
• W2155704505 hasPrimaryLocation W21557045051 @default.
• W2155704505 hasRelatedWork W2108015576 @default.
• W2155704505 hasRelatedWork W2128643451 @default.
• W2155704505 hasRelatedWork W2130966263 @default.
• W2155704505 hasRelatedWork W2349364331 @default.
• W2155704505 hasRelatedWork W2350158361 @default.
• W2155704505 hasRelatedWork W2359677393 @default.
• W2155704505 hasRelatedWork W2368289474 @default.
• W2155704505 hasRelatedWork W2385831594 @default.
• W2155704505 hasRelatedWork W3091728393 @default.
• W2155704505 hasRelatedWork W2019838093 @default.
• W2155704505 isParatext "false" @default.
• W2155704505 isRetracted "false" @default.
• W2155704505 magId "2155704505" @default.
• W2155704505 workType "article" @default.