Nonblocking Graphs: Greedy Algorithms to Compute Disjoint Paths.
Andreas SchwillPublished in: STACS (1990)
Keyphrases
- greedy algorithms
- disjoint paths
- greedy algorithm
- undirected graph
- directed graph
- knapsack problem
- search algorithm
- approximation algorithms
- graph theory
- graph partitioning
- spanning tree
- data sets
- graph matching
- multi dimensional
- graph structure
- graph model
- graph databases
- random walk
- random graphs
- approximation ratio
- image segmentation