Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.
Juraj HromkovicRalf KlasingElena StöhrHubert WagenerPublished in: Inf. Comput. (1995)
Keyphrases
- disjoint paths
- planar graphs
- undirected graph
- directed graph
- approximation algorithms
- spanning tree
- minimum weight
- connected components
- complex networks
- graph structure
- directed acyclic graph
- minimum cost
- np hard
- dynamic programming
- random walk
- bipartite graph
- parameter estimation
- edge weights
- linear programming
- markov random field