Name
Abstract | ||
|---|---|---|
Markovian evolving graphs [2] are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network scenarios. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/IPDPS.2009.5160986 | IEEE Trans. Parallel Distrib. Syst. |
Keywords | DocType | Volume |
nodes change,important dynamic-network scenario,fixed set,stationary markovian,arbitrary markovian rule,dynamic-graph model,markov process,mobile ad hoc networks,flooding,graph theory,mobile ad hoc network,mobile computer,random graphs,indexes,mobile computing,indexation,markov processes,mobile network,random graph,random walk,mobile communication,upper bound | Journal | 22 |
Issue | Citations | PageRank |
9 | 49 | 1.85 |
References | Authors | |
17 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrea E. F. Clementi | 1 | 1168 | 85.30 |
| Francesco Pasquale | 2 | 421 | 28.22 |
| Angelo Monti | 3 | 671 | 46.93 |
| Riccardo Silvestri | 4 | 1324 | 90.84 |