Algorithm for determining the mutual impact of nodes in weighted directed graphs.
Dmytro V. LandeOleh O. DmytrenkoMinglei FuMinchao HuDmytro MankoAndrei SnarskiiPublished in: Soft Comput. (2021)
Keyphrases
- directed graph
- undirected graph
- matching algorithm
- maximum flow
- high accuracy
- cost function
- dynamic programming
- graph structure
- np hard
- computational cost
- preprocessing
- detection algorithm
- learning algorithm
- spanning tree
- experimental evaluation
- optimal solution
- particle swarm optimization
- expectation maximization
- weighted distance
- recognition algorithm
- neural network
- convergence rate
- clustering method
- simulated annealing
- special case
- k means
- search space
- similarity measure