Representation of Edmonds' Algorithm for Finding Optimum Graph Branching on Associative Parallel Processors.
A. S. NepomniaschayaPublished in: Program. Comput. Softw. (2001)
Keyphrases
- learning algorithm
- parallel processors
- dynamic programming
- graph based algorithm
- computational complexity
- objective function
- cost function
- np hard
- information retrieval
- graph structure
- network flow
- worst case
- maximum clique
- parallel version
- single processor
- undirected graph
- spanning tree
- parallel implementation
- search algorithm
- optimal solution
- genetic algorithm