Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs.
Shin-Shin KaoLih-Hsing HsuPublished in: Appl. Math. Comput. (2005)
Keyphrases
- fault tolerant
- bipartite graph
- fault tolerance
- web mining
- bipartite networks
- distributed systems
- load balancing
- edge weights
- web crawling
- interconnection networks
- maximum matching
- link prediction
- state machine
- network structure
- social networks
- minimum weight
- bipartite graph matching
- link analysis
- web pages
- heterogeneous networks
- network analysis
- complex networks
- web documents
- safety critical
- mobile agent system
- mutual reinforcement
- search engine