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