The cost of monotonicity in distributed graph searching.
David IlcinkasNicolas NisseDavid SoguetPublished in: Distributed Comput. (2009)
Keyphrases
- communication cost
- distributed systems
- distributed environment
- distributed data
- graph representation
- high cost
- bipartite graph
- directed graph
- communication overhead
- random walk
- peer to peer
- path length
- graph theoretic
- np hard
- graph theory
- weighted graph
- multi agent
- graph model
- bandwidth consumption
- anti monotonic
- distributed sensor networks
- graph partitioning
- graph structure
- undirected graph
- graph databases
- neural network
- fault tolerant
- computer networks
- connected components
- structured data
- multi agent systems
- web services