Matches in SemOpenAlex for { <https://semopenalex.org/work/W2221641379> ?p ?o ?g. }
- W2221641379 endingPage "151" @default.
- W2221641379 startingPage "141" @default.
- W2221641379 abstract "We consider the standard message passing model; we assume the system is fully synchronous: all processes start at the same time and time proceeds in synchronised rounds. In each round each vertex can transmit a different message of size O ( 1 ) to each of its neighbours. This paper proposes and analyses a distributed enumeration algorithm of vertices of a graph having a distinguished vertex which satisfies that two vertices with consecutive numbers are at distance at most 3. We prove that its time complexity is O ( n ) where n is the number of vertices of the graph. Furthermore, the size of each message is O ( 1 ) thus its bit complexity is also O ( n ) . We provide some links between this enumeration and Hamiltonian graphs from which we deduce that this enumeration is optimal in the sense that there does not exist an enumeration which satisfies that two vertices with consecutive numbers are at distance at most 2. We deduce from this enumeration, algorithms which compute all pairs shortest paths and the diameter with a time complexity and a bit complexity equal to O ( n ) ." @default.
- W2221641379 created "2016-06-24" @default.
- W2221641379 creator A5008889141 @default.
- W2221641379 creator A5011435246 @default.
- W2221641379 creator A5084035589 @default.
- W2221641379 date "2016-04-01" @default.
- W2221641379 modified "2023-09-30" @default.
- W2221641379 title "A distributed enumeration algorithm and applications to all pairs shortest paths, diameter…" @default.
- W2221641379 cites W147275194 @default.
- W2221641379 cites W1489604929 @default.
- W2221641379 cites W1497938971 @default.
- W2221641379 cites W1507039213 @default.
- W2221641379 cites W1552044364 @default.
- W2221641379 cites W1568961751 @default.
- W2221641379 cites W1582638066 @default.
- W2221641379 cites W1975832752 @default.
- W2221641379 cites W1977127383 @default.
- W2221641379 cites W1987669032 @default.
- W2221641379 cites W1989652459 @default.
- W2221641379 cites W1990846349 @default.
- W2221641379 cites W2002501531 @default.
- W2221641379 cites W2028535821 @default.
- W2221641379 cites W2040011014 @default.
- W2221641379 cites W2045859197 @default.
- W2221641379 cites W2048098617 @default.
- W2221641379 cites W2049500052 @default.
- W2221641379 cites W2083323175 @default.
- W2221641379 cites W2084803275 @default.
- W2221641379 cites W2085540843 @default.
- W2221641379 cites W2085612824 @default.
- W2221641379 cites W2096111774 @default.
- W2221641379 cites W2112702616 @default.
- W2221641379 cites W2125685395 @default.
- W2221641379 cites W2136604606 @default.
- W2221641379 cites W2153507546 @default.
- W2221641379 cites W2156047991 @default.
- W2221641379 cites W2157459553 @default.
- W2221641379 cites W2328351960 @default.
- W2221641379 cites W2330053191 @default.
- W2221641379 cites W2340787257 @default.
- W2221641379 cites W2406365342 @default.
- W2221641379 cites W2618199688 @default.
- W2221641379 cites W2618878714 @default.
- W2221641379 cites W3145128584 @default.
- W2221641379 cites W54630777 @default.
- W2221641379 doi "https://doi.org/10.1016/j.ic.2015.12.004" @default.
- W2221641379 hasPublicationYear "2016" @default.
- W2221641379 type Work @default.
- W2221641379 sameAs 2221641379 @default.
- W2221641379 citedByCount "2" @default.
- W2221641379 countsByYear W22216413792016 @default.
- W2221641379 countsByYear W22216413792019 @default.
- W2221641379 crossrefType "journal-article" @default.
- W2221641379 hasAuthorship W2221641379A5008889141 @default.
- W2221641379 hasAuthorship W2221641379A5011435246 @default.
- W2221641379 hasAuthorship W2221641379A5084035589 @default.
- W2221641379 hasBestOaLocation W22216413791 @default.
- W2221641379 hasConcept C11413529 @default.
- W2221641379 hasConcept C114614502 @default.
- W2221641379 hasConcept C120314980 @default.
- W2221641379 hasConcept C130120984 @default.
- W2221641379 hasConcept C132525143 @default.
- W2221641379 hasConcept C156340839 @default.
- W2221641379 hasConcept C22590252 @default.
- W2221641379 hasConcept C33923547 @default.
- W2221641379 hasConcept C41008148 @default.
- W2221641379 hasConcept C70266271 @default.
- W2221641379 hasConcept C80444323 @default.
- W2221641379 hasConceptScore W2221641379C11413529 @default.
- W2221641379 hasConceptScore W2221641379C114614502 @default.
- W2221641379 hasConceptScore W2221641379C120314980 @default.
- W2221641379 hasConceptScore W2221641379C130120984 @default.
- W2221641379 hasConceptScore W2221641379C132525143 @default.
- W2221641379 hasConceptScore W2221641379C156340839 @default.
- W2221641379 hasConceptScore W2221641379C22590252 @default.
- W2221641379 hasConceptScore W2221641379C33923547 @default.
- W2221641379 hasConceptScore W2221641379C41008148 @default.
- W2221641379 hasConceptScore W2221641379C70266271 @default.
- W2221641379 hasConceptScore W2221641379C80444323 @default.
- W2221641379 hasLocation W22216413791 @default.
- W2221641379 hasLocation W22216413792 @default.
- W2221641379 hasLocation W22216413793 @default.
- W2221641379 hasOpenAccess W2221641379 @default.
- W2221641379 hasPrimaryLocation W22216413791 @default.
- W2221641379 hasRelatedWork W1595159684 @default.
- W2221641379 hasRelatedWork W2053389894 @default.
- W2221641379 hasRelatedWork W2221641379 @default.
- W2221641379 hasRelatedWork W2352589493 @default.
- W2221641379 hasRelatedWork W2385402343 @default.
- W2221641379 hasRelatedWork W2395868876 @default.
- W2221641379 hasRelatedWork W2810620529 @default.
- W2221641379 hasRelatedWork W3183360588 @default.
- W2221641379 hasRelatedWork W3200343262 @default.
- W2221641379 hasRelatedWork W4253588386 @default.
- W2221641379 hasVolume "247" @default.
- W2221641379 isParatext "false" @default.
- W2221641379 isRetracted "false" @default.
- W2221641379 magId "2221641379" @default.