Login / Signup
Replication, refinement & reachability: complexity in dynamic condition-response graphs.
Søren Debois
Thomas T. Hildebrandt
Tijs Slaats
Published in:
Acta Informatica (2018)
Keyphrases
</>
dynamic networks
computational cost
state space
computational complexity
fault tolerant
fault tolerance
group communication
search algorithm
data partitioning
space complexity
graph structure
graph matching
directed graph
dynamic environments
sufficient conditions
worst case
lower bound