Parallel updating algorithms for graph searching problems.
Pranay ChaudhuriPublished in: J. Syst. Archit. (1996)
Keyphrases
- optimization problems
- graph theory
- run times
- partitioning algorithm
- approximate solutions
- graph layout
- learning algorithm
- maximum flow
- benchmark problems
- data structure
- parallel processing
- parallel architectures
- search strategies
- search methods
- combinatorial optimization
- shared memory
- graph representation
- random walk
- depth first search
- graph search
- worst case
- knn
- np hard
- polynomial time complexity