Matches in SemOpenAlex for { <https://semopenalex.org/work/W1556289327> ?p ?o ?g. }
Showing items 1 to 83 of
83
with 100 items per page.
- W1556289327 endingPage "428" @default.
- W1556289327 startingPage "415" @default.
- W1556289327 abstract "Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknown means that the searchers are provided no a priori information about the graph. However, the strategy that is actually performed lacks of an important property, namely the monotonicity. That is, the clear part of the graph may decrease at some steps of the execution of the protocol. Actually, the protocol of Blin et al. is executed in exponential time. Nisse and Soguet (2007) proved that, in order to ensure the smallest number of searchers to clear any n-node graph in a monotone way, it is necessary and sufficient to provide Θ(n logn) bits of information to the searchers by putting short labels on the nodes of the graph. This paper deals with the smallest number of searchers that are necessary and sufficient to monotoneously clear any graph in a decentralized manner, when the searchers have no a priori information about the graph.The distributed graph searching problem considers a team of searchers that is aiming at clearing any connected contaminated graph. The clearing of the graph is required to be connected, i.e., the clear part of the graph must remain permanently connected, and monotone, i.e., the clear part of the graph only grows. The search number Open image in new window of a graph G is the smallest number of searchers necessary to clear G in a monotone connected way in centralized settings. We prove that any distributed protocol aiming at clearing any unknown n-node graph in a monotone connected way, in decentralized settings, has competitive ratio (Theta(frac{n}{log n})). That is, we prove that, for any distributed protocol (cal P), there exists a constant c such that for any sufficiently large n, there exists a n-node graph G such that (cal P) requires at least Open image in new window searchers to clear G. Moreover, we propose a distributed protocol that allows Open image in new window searchers to clear any unknown asynchronous n-node graph G in a monotone connected way." @default.
- W1556289327 created "2016-06-24" @default.
- W1556289327 creator A5021373855 @default.
- W1556289327 creator A5057804168 @default.
- W1556289327 creator A5083136878 @default.
- W1556289327 date "2008-04-11" @default.
- W1556289327 modified "2023-10-09" @default.
- W1556289327 title "The Cost of Monotonicity in Distributed Graph Searching" @default.
- W1556289327 cites W1485896631 @default.
- W1556289327 cites W1579357699 @default.
- W1556289327 cites W1874754796 @default.
- W1556289327 cites W1892804188 @default.
- W1556289327 cites W1998007106 @default.
- W1556289327 cites W2006510951 @default.
- W1556289327 cites W2114999968 @default.
- W1556289327 cites W2154788235 @default.
- W1556289327 cites W2155760054 @default.
- W1556289327 cites W2395279694 @default.
- W1556289327 cites W4235450614 @default.
- W1556289327 cites W4255502701 @default.
- W1556289327 doi "https://doi.org/10.1007/978-3-540-77096-1_30" @default.
- W1556289327 hasPublicationYear "2008" @default.
- W1556289327 type Work @default.
- W1556289327 sameAs 1556289327 @default.
- W1556289327 citedByCount "1" @default.
- W1556289327 crossrefType "book-chapter" @default.
- W1556289327 hasAuthorship W1556289327A5021373855 @default.
- W1556289327 hasAuthorship W1556289327A5057804168 @default.
- W1556289327 hasAuthorship W1556289327A5083136878 @default.
- W1556289327 hasBestOaLocation W15562893272 @default.
- W1556289327 hasConcept C114614502 @default.
- W1556289327 hasConcept C118615104 @default.
- W1556289327 hasConcept C132525143 @default.
- W1556289327 hasConcept C168291704 @default.
- W1556289327 hasConcept C17169500 @default.
- W1556289327 hasConcept C203776342 @default.
- W1556289327 hasConcept C22149727 @default.
- W1556289327 hasConcept C2524010 @default.
- W1556289327 hasConcept C2834757 @default.
- W1556289327 hasConcept C33923547 @default.
- W1556289327 hasConcept C41008148 @default.
- W1556289327 hasConcept C64339825 @default.
- W1556289327 hasConcept C80444323 @default.
- W1556289327 hasConceptScore W1556289327C114614502 @default.
- W1556289327 hasConceptScore W1556289327C118615104 @default.
- W1556289327 hasConceptScore W1556289327C132525143 @default.
- W1556289327 hasConceptScore W1556289327C168291704 @default.
- W1556289327 hasConceptScore W1556289327C17169500 @default.
- W1556289327 hasConceptScore W1556289327C203776342 @default.
- W1556289327 hasConceptScore W1556289327C22149727 @default.
- W1556289327 hasConceptScore W1556289327C2524010 @default.
- W1556289327 hasConceptScore W1556289327C2834757 @default.
- W1556289327 hasConceptScore W1556289327C33923547 @default.
- W1556289327 hasConceptScore W1556289327C41008148 @default.
- W1556289327 hasConceptScore W1556289327C64339825 @default.
- W1556289327 hasConceptScore W1556289327C80444323 @default.
- W1556289327 hasLocation W15562893271 @default.
- W1556289327 hasLocation W15562893272 @default.
- W1556289327 hasLocation W15562893273 @default.
- W1556289327 hasLocation W15562893274 @default.
- W1556289327 hasLocation W15562893275 @default.
- W1556289327 hasLocation W15562893276 @default.
- W1556289327 hasLocation W15562893277 @default.
- W1556289327 hasLocation W15562893278 @default.
- W1556289327 hasLocation W15562893279 @default.
- W1556289327 hasOpenAccess W1556289327 @default.
- W1556289327 hasPrimaryLocation W15562893271 @default.
- W1556289327 hasRelatedWork W1984872498 @default.
- W1556289327 hasRelatedWork W1999761254 @default.
- W1556289327 hasRelatedWork W2091386242 @default.
- W1556289327 hasRelatedWork W2186663447 @default.
- W1556289327 hasRelatedWork W2362470504 @default.
- W1556289327 hasRelatedWork W2781648179 @default.
- W1556289327 hasRelatedWork W2793949464 @default.
- W1556289327 hasRelatedWork W4221122724 @default.
- W1556289327 hasRelatedWork W4302567657 @default.
- W1556289327 hasRelatedWork W2954009223 @default.
- W1556289327 isParatext "false" @default.
- W1556289327 isRetracted "false" @default.
- W1556289327 magId "1556289327" @default.
- W1556289327 workType "book-chapter" @default.