Computing the Stopping Distance of a Tanner Graph Is NP-Hard.
Karunakaran Murali KrishnanPriti ShankarPublished in: IEEE Trans. Inf. Theory (2007)
Keyphrases
- np hard
- maximum weight
- graph theory
- special case
- random walk
- approximation algorithms
- directed graph
- distance matrix
- distance function
- scheduling problem
- min sum
- distance measure
- graph representation
- computational complexity
- graph based algorithm
- path length
- edge weights
- graph model
- bayesian networks
- homology generators
- optimal solution
- structured data
- graph theoretic
- np complete
- decision problems
- minimum cost
- branch and bound algorithm
- weighted graph
- graph structure
- spanning tree
- undirected graph
- bipartite graph
- euclidean distance
- closely related
- set cover
- computationally hard
- constraint satisfaction problems
- linear programming
- graph matching