Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs.
Abhash AnandSurender BaswanaManoj GuptaSandeep SenPublished in: FSTTCS (2012)
Keyphrases
- graph matching
- association graph
- approximate matching
- dynamic environments
- dynamic networks
- matching algorithm
- feature matching
- maximum number
- matching process
- graph model
- computer vision
- subgraph isomorphism
- spanning tree
- weighted graph
- image matching
- pattern recognition
- graph mining
- graph theory
- graph representation
- minimum distance
- lower bound
- neural network
- dynamic graph
- maximum cardinality
- attributed relational graph