On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
Hans-Joachim BöckenhauerDirk BongartzJuraj HromkovicRalf KlasingGuido ProiettiSebastian SeibertWalter UngerPublished in: Theor. Comput. Sci. (2004)
Keyphrases
- triangle inequality
- subgraph isomorphism
- similarity search
- graph databases
- graph mining
- edit distance
- nearest neighbor
- quadratic assignment problem
- satisfy the triangle inequality
- dissimilarity measure
- metric space
- similarity function
- distance metric
- distance measure
- distance function
- phase transition
- connected components
- edge weights
- pre computed
- feature space
- data structure
- graph structure
- weighted graph
- nearest neighbor search
- data sets