Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
Joseph CheriyanRamakrishna ThurimellaPublished in: Electron. Colloquium Comput. Complex. (1998)
Keyphrases
- data structure
- graph matching
- matching process
- subgraph isomorphism
- maximal cliques
- matching algorithm
- constant factor
- object recognition
- keypoints
- connected components
- graph mining
- maximum clique
- data mining
- ontology matching
- shape matching
- standard deviation
- template matching
- lower bound
- computational complexity
- multiscale
- computer vision