Peer-to-peer networks based on random transformations of connected regular undirected graphs.
Peter MahlmannChristian SchindelhauerPublished in: SPAA (2005)
Keyphrases
- peer to peer networks
- undirected graph
- connected components
- peer to peer
- directed graph
- hierarchical peer to peer networks
- distributed environment
- directed acyclic graph
- approximation algorithms
- resource selection
- graph structure
- binary images
- disjoint paths
- minimum cost
- spanning tree
- vertex set
- random graphs
- query routing
- special case
- databases
- strongly connected
- multimedia
- complex networks
- database systems
- federated search
- multi agent
- np hard
- web search