Efficient Algorithm for the b-Matching Graph.
Yasuhiro FujiwaraAtsutoshi KumagaiSekitoshi KanaiYasutoshi IdaNaonori UedaPublished in: KDD (2020)
Keyphrases
- matching algorithm
- single pass
- objective function
- computationally efficient
- cost function
- dynamic programming
- detection algorithm
- learning algorithm
- k means
- computational cost
- high efficiency
- similarity measure
- minimum spanning tree
- solution path
- graph structure
- recognition algorithm
- subgraph isomorphism
- graph matching
- image matching
- computational complexity
- image sequences
- segmentation algorithm
- expectation maximization
- particle swarm optimization
- directed acyclic graph
- probabilistic model
- np hard
- search space
- maximum weight