Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs.
K. Murali KrishnanL. Sunil ChandranPublished in: FSTTCS (2006)
Keyphrases
- distance measure
- closed form
- random graphs
- euclidean norm
- distance function
- graph mining
- phase transition
- graph matching
- graph kernels
- minimum distance
- graph databases
- graph structure
- distance transform
- bipartite graph
- learning theory
- optimal solution
- error bounds
- directed graph
- information theoretic
- distance metric
- low cost
- worst case
- nearest neighbor
- np hard