Flooding time in edge-Markovian dynamic graphs
From MaRDI portal
(Redirected from Publication:2934348)
Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20)
Recommendations
Cited in
(53)- Temporal network optimization subject to connectivity constraints
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss
- Cover time in edge-uniform stochastically-evolving graphs
- Distributed community detection in dynamic graphs
- Continuous-time independent edge-Markovian random graph process
- Discovery through gossip
- Traveling salesman problems in temporal graphs
- Rumor spreading in random evolving graphs
- Distributed Community Detection in Dynamic Graphs
- Coordinated consensus in dynamic networks
- Error-free multi-valued consensus with Byzantine failures
- Distributed graph coloring in a few rounds
- MIS on trees
- Toward more localized local algorithms, removing assumptions concerning global knowledge
- The complexity of robust atomic storage
- Resilience of mutual exclusion algorithms to transient memory faults
- The impact of memory models on software reliability in multiprocessors
- A complexity separation between the cache-coherent and distributed shared memory models
- From bounded to unbounded concurrency objects and back
- Locally checkable proofs
- Fault-tolerant spanners
- Adaptively secure broadcast, revisited
- Scalable rational secret sharing
- Analyzing consistency properties for fun and profit
- Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
- Optimal-time adaptive strong renaming, with applications to counting
- The round complexity of distributed sorting, extended abstract
- A tight unconditional lower bound on distributed randomwalk computation
- Minimum congestion mapping in a cloud
- Conflict on a communication channel
- Xheal, localized self-healing using expanders
- Stability of a peer-to-peer communication system
- Tight bounds on information dissemination in sparse mobile networks
- Time-efficient randomized multiple-message broadcast in radio networks
- Faster information dissemination in dynamic networks via network coding
- Flooding time of edge-Markovian evolving graphs
- Parsimonious flooding in geometric random-walks (extended abstract)
- Evaluating the impact of selfish behaviors on epidemic forwarding in mobile social networks
- An introduction to temporal graphs: an algorithmic perspective
- Parsimonious flooding in dynamic graphs
- Information spreading in dynamic networks: an analytical approach
- An introduction to temporal graphs: an algorithmic perspective
- Byzantine agreement with homonyms
- Structuring unreliable radio networks
- Distributed deterministic edge coloring using bounded neighborhood independence
- Compact policy routing
- Order optimal information spreading using algebraic gossip
- Sharp Thresholds in Random Simple Temporal Graphs
- Parsimonious flooding in dynamic graphs
- Effects of concurrency on epidemic spreading in Markovian temporal networks
- Parsimonious flooding in geometric random-walks
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
This page was built for publication: Flooding time in edge-Markovian dynamic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934348)
