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: FSTTCS (2002)
Keyphrases
- triangle inequality
- graph databases
- similarity search
- graph mining
- quadratic assignment problem
- subgraph isomorphism
- nearest neighbor
- metric space
- distance function
- graph matching
- satisfy the triangle inequality
- data structure
- connected components
- similarity function
- dissimilarity measure
- edge weights
- directed graph
- nearest neighbor search
- pre computed
- phase transition
- computational complexity
- graph structure
- complex networks
- distance metric
- distance measure
- query processing