Fast Distributed DFS Solutions for Edge-Disjoint Paths in Digraphs.
Hossam ElGindyRadu NicolescuHuiling WuPublished in: Int. Conf. on Membrane Computing (2012)
Keyphrases
- disjoint paths
- directed graph
- undirected graph
- approximation algorithms
- distributed systems
- cooperative
- distributed environment
- random walk
- peer to peer
- lightweight
- edge detection
- neural network
- computing environments
- connected components
- depth first search
- communication cost
- fault tolerant
- computer networks
- special case
- multi agent
- reinforcement learning